On 2-Connected Transmission Irregular Graphs

被引：0
|
作者：
Dobrynin A.A. [1 ]
机构：
[1] Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk
来源：
Dobrynin, A.A. (dobr@math.nsc.ru) | 2018年 / Pleiades journals卷 / 12期
基金：
俄罗斯基础研究基金会;
关键词：
graph; transmission irregular graph; vertex transmission; Wiener index;
D O I：
10.1134/S199047891804004X
中图分类号：
学科分类号：
摘要：
The transmission of a vertex v in a graph is the sum of the distances from v to all other vertices of the graph. In a transmission irregular graph, the transmissions of all vertices are pairwise distinct. It is known that almost all graphs are not transmission irregular. Some infinite family of transmission irregular trees was constructed by Alizadeh and Klavžar [Appl.Math. Comput. 328, 113–118 (2018)] and the following problemwas formulated: Is there an infinite family of 2-connected graphs with the property? In this article, we construct an infinite family of 2-connected transmission irregular graphs. © 2018, Pleiades Publishing, Ltd.
引用
收藏
页码：642 / 647
页数：5
相关论文
共 50 条
  • [41] MAXIMUM CHROMATIC POLYNOMIALS OF 2-CONNECTED GRAPHS
    TOMESCU, I
    JOURNAL OF GRAPH THEORY, 1994, 18 (04) : 329 - 336
  • [42] 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
  • [43] 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)
  • [44] Covering contractible edges in 2-connected graphs
    Chan, Tsz Lung
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 70 : 309 - 318
  • [45] Reconstruction of distance hereditary 2-connected graphs
    Priya, P. Devi
    Monikandan, S.
    DISCRETE MATHEMATICS, 2018, 341 (08) : 2326 - 2331
  • [46] 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
  • [47] Asymptotic enumeration of sparse 2-connected graphs
    Kemkes, Graeme
    Sato, Cristiane M.
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (03) : 354 - 376
  • [48] On hamiltonicity of 2-connected claw-free graphs
    TIAN Runli XIONG LimingDepartment of MathematicsBeijing Institute of TechnologyBeijing ChinaDepartment of MathematicsJiangxi Normal UniversityNanchang China
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 2012, 27 (02) : 234 - 242
  • [49] PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS
    GAO Jingzhen(Department of Mathematics
    SystemsScienceandMathematicalSciences, 1996, (01) : 5 - 12
  • [50] Small cycle cover of 2-connected cubic graphs
    Lai, HJ
    Li, XW
    DISCRETE MATHEMATICS, 2003, 269 (1-3) : 295 - 302
12345