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 条
  • [11] Cycles in 2-connected graphs
    Fan, GH
    Lv, XZ
    Wang, P
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 92 (02) : 379 - 394
  • [12] The connectivities of trunk graphs of 2-connected graphs
    Yoshimoto, K
    ARS COMBINATORIA, 2001, 60 : 225 - 237
  • [13] The connectivities of leaf graphs of 2-connected graphs
    Kaneko, A
    Yoshimoto, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (02) : 155 - 169
  • [14] Hamiltonicity of regular 2-connected graphs
    Broersma, HJ
    vandenHeuvel, J
    Jackson, B
    Veldman, HJ
    JOURNAL OF GRAPH THEORY, 1996, 22 (02) : 105 - 124
  • [15] Precoloring extension for 2-connected graphs
    Voigt, Margit
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) : 258 - 263
  • [16] Reconstruction of 2-connected parity graphs
    Priya, P. Devi
    Monikandan, S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 80 : 167 - 177
  • [17] THE LONGEST CYCLE IN 2-CONNECTED GRAPHS
    陈冠涛
    卫兵
    吴海东
    ScienceBulletin, 1987, (21) : 1507 - 1507
  • [18] Strongly 2-connected orientations of graphs
    Thomassen, Carsten
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 110 : 67 - 78
  • [19] ON THE CIRCUMFERENCES OF 2-CONNECTED BIPARTITE GRAPHS
    DANG, KQ
    ZHAO, LC
    ARS COMBINATORIA, 1989, 27 : 203 - 210
  • [20] Hamiltonicity in 2-connected graphs with claws
    Li, H
    Lu, M
    Sun, ZR
    DISCRETE MATHEMATICS, 1998, 183 (1-3) : 223 - 236
12345