Infinite family of 3-connected cubic transmission irregular graphs

被引：15
|
作者：
Dobrynin, Andrey A. [1 ,2 ]
机构：
[1] Novosibirsk State Univ, Novosibirsk 630090, Russia
[2] Russian Acad Sci, Siberian Branch, Sobolev Inst Math, Novosibirsk 630090, Russia
来源：
DISCRETE APPLIED MATHEMATICS | 2019年 / 257卷
关键词：
Graph invariant; Vertex transmission; Transmission irregular graph; Wiener complexity; WIENER INDEX; COMPLEXITY; TREES;
D O I：
10.1016/j.dam.2018.10.036
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph G. The transmission of a vertex v is the sum of distances from v 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 and 2-connected graphs were presented in Alizadeh and Klavzar (2018) and Dobrynin (2019) [8, 9]. The following problem was posed in Alizadeh and Klavzar (2018): do there exist infinite families of regular transmission irregular graphs? In this paper, an infinite family of 3-connected cubic transmission irregular graphs is constructed. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：151 / 157
页数：7
相关论文
共 50 条
  • [31] Cycles through 23 vertices in 3-connected cubic planar graphs
    Aldred, REL
    Bau, S
    Holton, DA
    McKay, BD
    GRAPHS AND COMBINATORICS, 1999, 15 (04) : 373 - 376
  • [32] Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs
    Kardos, Frantisek
    Macajova, Edita
    Zerafa, Jean Paul
    COMBINATORICA, 2025, 45 (01)
  • [33] CYCLES THROUGH GIVEN VERTICES IN PLANAR 3-CONNECTED CUBIC GRAPHS
    FOUQUET, JL
    THUILLIER, H
    ARS COMBINATORIA, 1985, 20B : 75 - 105
  • [34] ON CYCLES CONTAINING EIGHT VERTICES AND AN EDGE IN 3-CONNECTED CUBIC GRAPHS
    SHENG, B
    HOLTON, DA
    ARS COMBINATORIA, 1988, 26A : 21 - 34
  • [35] Tight cycle spectrum gaps of cubic 3-connected toroidal graphs
    Lo, On-Hei Solomon
    Zamfirescu, Carol T.
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [36] THE MINIMUM-ORDER 3-CONNECTED CUBIC GRAPHS WITH SPECIFIED DIAMETERS
    MYERS, BR
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1980, 27 (08): : 698 - 709
  • [37] Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs
    R. E. L. Aldred
    S. Bau
    D. A. Holton
    Brendan D. McKay
    Graphs and Combinatorics, 1999, 15 : 373 - 376
  • [38] DECOMPOSITION OF 3-CONNECTED GRAPHS
    COULLARD, CR
    GARDNER, LL
    WAGNER, DK
    COMBINATORICA, 1993, 13 (01) : 7 - 30
  • [39] A CONSTRUCTION OF 3-CONNECTED GRAPHS
    BARNETTE, DW
    ISRAEL JOURNAL OF MATHEMATICS, 1994, 86 (1-3) : 397 - 407
  • [40] EXTREMAL 3-CONNECTED GRAPHS
    LOCKE, SC
    DISCRETE MATHEMATICS, 1988, 68 (2-3) : 257 - 263
12345