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 条
  • [31] The effect on eigenvalues of connected graphs by adding edges
    Guo, Ji-Ming
    Tong, Pan-Pan
    Li, Jianxi
    Shiu, Wai Chee
    Wang, Zhi-Wen
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2018, 548 : 57 - 65
  • [32] The ordering of trees and connected graphs by algebraic connectivity
    Shao, Jia-Yu
    Gua, Ji-Ming
    Shan, Hai-Ying
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 428 (07) : 1421 - 1438
  • [33] Wiener-Hosoya Matrix of Connected Graphs
    Ibrahim, Hassan
    Sharafdini, Reza
    Reti, Tamas
    Akwu, Abolape
    MATHEMATICS, 2021, 9 (04) : 1 - 12
  • [34] Wiener Index of k-Connected Graphs
    Qin, Xiang
    Zhao, Yanhua
    Wu, Baoyindureng
    JOURNAL OF INTERCONNECTION NETWORKS, 2021, 21 (04)
  • [35] On connected k-domination numbers, of graphs
    Li, SG
    DISCRETE MATHEMATICS, 2004, 274 (1-3) : 303 - 310
  • [36] A CHAIN THEOREM FOR 3+-CONNECTED GRAPHS
    Ding, Guoli
    Liu, Cheng
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) : 102 - 113
  • [37] Minimum 3-geodetically connected graphs
    Bosíková, M
    DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 263 - 283
  • [38] Bandwidth of the strong product of two connected graphs
    Kojima, Toru
    DISCRETE MATHEMATICS, 2008, 308 (07) : 1282 - 1295
  • [39] The flip Markov chain for connected regular graphs
    Cooper, Colin
    Dyer, Martin
    Greenhill, Catherine
    Handley, Andrew
    DISCRETE APPLIED MATHEMATICS, 2019, 254 : 56 - 79
  • [40] On the smallest eigenvalue of Dα-matrix of connected graphs
    Alhevaz, Abdollah
    Baghipur, Maryam
    Pirzada, Shariefuddin
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21) : 6478 - 6499
12345