Infinite family of 2-connected transmission irregular graphs

被引：14
|
作者：
Dobrynin, Andrey A. [1 ,2 ]
机构：
[1] Novosibirsk State Univ, Novosibirsk 630090, Russia
[2] Russian Acad Sci, Sobolev Inst Math, Siberian Branch, Novosibirsk 630090, Russia
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2019年 / 340卷
关键词：
Vertex transmission; Transmission irregular graph; Wiener complexity; WIENER INDEX; TOPOLOGICAL INDEXES; COMPLEXITY; TREES;
D O I：
10.1016/j.amc.2018.08.042
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Distance between two vertices is the number of edges in the shortest path connecting them in a connected graph G. The transmission of a vertex nu is the sum of distances from nu to all the other vertices of G. If transmissions of all vertices are mutually distinct, then G is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees were presented in [4]. The following problem was posed in [4]: do there exist infinite families of 2-connected transmission irregular graphs? In this paper, an infinite family of such graphs is constructed. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：1 / 4
页数：4
相关论文
共 50 条
  • [41] 2-connected graphs with the minimum algebraic connectivity
    Yu, Guanglong
    Sun, Lin
    Zhang, Hailiang
    Wu, Yarong
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21): : 6108 - 6113
  • [42] On even triangulations of 2-connected embedded graphs
    Zhang, HM
    He, X
    SIAM JOURNAL ON COMPUTING, 2005, 34 (03) : 683 - 696
  • [43] On Heavy Paths in 2-connected Weighted Graphs
    Bin-long LI
    Sheng-gui ZHANG
    ActaMathematicaeApplicataeSinica, 2017, 33 (03) : 789 - 798
  • [44] Connectivity keeping trees in 2-connected graphs
    Lu, Changhong
    Zhang, Ping
    DISCRETE MATHEMATICS, 2020, 343 (02)
  • [45] MAXIMUM CHROMATIC POLYNOMIALS OF 2-CONNECTED GRAPHS
    TOMESCU, I
    JOURNAL OF GRAPH THEORY, 1994, 18 (04) : 329 - 336
  • [46] ON DETERMINATION AND CONSTRUCTION OF CRITICALLY 2-CONNECTED GRAPHS
    Borse, Y. M.
    Waphare, B. N.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2010, 7 (01) : 73 - 83
  • [47] Outer-connected domination in 2-connected cubic graphs
    Wang, Shipeng
    Wu, Baoyindureng
    An, Xinhui
    Liu, Xiaoping
    Deng, Xingchao
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (03)
  • [48] The rainbow connection number of 2-connected graphs
    Ekstein, Jan
    Holub, Premysl
    Kaiser, Tomas
    Koch, Maria
    Camacho, Stephan Matos
    Ryjacek, Zdenek
    Schiermeyer, Ingo
    DISCRETE MATHEMATICS, 2013, 313 (19) : 1884 - 1892
  • [49] Asymptotic enumeration of sparse 2-connected graphs
    Kemkes, Graeme
    Sato, Cristiane M.
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (03) : 354 - 376
  • [50] Covering contractible edges in 2-connected graphs
    Chan, Tsz Lung
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 70 : 309 - 318
12345