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
相关论文
共 27 条
  • [11] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Toru Hasunuma
    Algorithmica, 2021, 83 : 2697 - 2718
  • [12] Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
    Tian, Yingzhi
    Lai, Hong-Jian
    Xu, Liqiong
    Meng, Jixiang
    DISCRETE MATHEMATICS, 2019, 342 (02) : 344 - 351
  • [13] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Hasunuma, Toru
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 316 - 329
  • [14] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Hasunuma, Toru
    ALGORITHMICA, 2021, 83 (09) : 2697 - 2718
  • [15] On Transmission Irregular Cubic Graphs of an Arbitrary Order
    Bezhaev, Anatoly Yu
    Dobrynin, Andrey A.
    MATHEMATICS, 2022, 10 (15)
  • [16] 2-Connected graphs with minimum general sum-connectivity index
    Tomescu, Ioan
    DISCRETE APPLIED MATHEMATICS, 2014, 178 : 135 - 141
  • [17] New transmission irregular chemical graphs
    Xu, Kexiang
    Tian, Jing
    Klavzar, Sandi
    DISCRETE APPLIED MATHEMATICS, 2023, 340 : 286 - 295
  • [18] Constructing new families of transmission irregular graphs
    Xu, Kexiang
    Klavzar, Sandi
    DISCRETE APPLIED MATHEMATICS, 2021, 289 : 383 - 391
  • [19] On stepwise transmission irregular graphs
    Al-Yakoob, Salem
    Stevanovic, Dragan
    APPLIED MATHEMATICS AND COMPUTATION, 2022, 413
  • [20] Extremal results on stepwise transmission irregular graphs
    Alizadeh, Yaser
    Klavzar, Sandi
    FILOMAT, 2023, 37 (04) : 1271 - 1276
123