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 条
  • [21] ROMAN DOMINATION ON 2-CONNECTED GRAPHS
    Liu, Chun-Hung
    Chang, Gerard J.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) : 193 - 205
  • [22] On domination in 2-connected cubic graphs
    Stodolsky, B. Y.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [23] On the circumferences of regular 2-connected graphs
    Bing, W
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 75 (01) : 88 - 99
  • [24] Traceability on 2-connected line graphs
    Tian, Tao
    Xiong, Liming
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 321 : 463 - 471
  • [25] THE LONGEST CYCLE IN 2-CONNECTED GRAPHS
    CHEN, GT
    WEI, B
    WU, HD
    KEXUE TONGBAO, 1987, 32 (21): : 1507 - 1507
  • [26] 2-connected and 2-edge-connected Steinhaus graphs
    Kim, D
    Lim, D
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 257 - 265
  • [27] HAMILTON CYCLES IN REGULAR 2-CONNECTED GRAPHS
    JACKSON, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 29 (01) : 27 - 46
  • [28] On heavy paths in 2-connected weighted graphs
    Li, Bin-long
    Zhang, Sheng-gui
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2017, 33 (03): : 789 - 798
  • [29] Note on dominating cycles in 2-connected graphs
    Discrete Math, 1-3 (13):
  • [30] Entire coloring of 2-connected plane graphs
    Wang, Weifan
    Hu, Xiaoxue
    Wang, Yiqiao
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 94
12345