论文标题
在间隔传输不规则图上
On interval transmission irregular graphs
论文作者
论文摘要
连接图G的顶点V的传输是G中从V到所有其他顶点的距离的总和。如果没有两个顶点具有相同的传输，则图形G是不规则的（Ti），并且G是间隔传输不规则（ITI），如果它是Ti，并且是G构成G形成连续整数的G序列的顶点。在这里，我们对Dobrynin的问题给出了积极的答案[Appl Math Comput 340（2019），1-4] ITI图的无限家族是否存在。
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission irregular (ITI) if it is TI and the vertex transmissions of G form a sequence of consecutive integers. Here we give a positive answer to the question of Dobrynin [Appl Math Comput 340 (2019), 1-4] of whether infinite families of ITI graphs exist.
