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 条
12345