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