An upper bound on the radius of a 3-edge-connected graph

被引：0
|
作者：
Dankelmann, Peter [1 ]
Mukwembi, Simon [1 ]
Swart, Henda C. [1 ]
机构：
[1] Univ KwaZulu Natal, Sch Math Sci, ZA-4041 Durban, South Africa
来源：
UTILITAS MATHEMATICA | 2007年 / 73卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a 3-edge-connected graph of order n and radius rad(G). Then the inequality [GRAPHICS] is proved. Moreover, graphs are constructed to show that the bound is asymptotically sharp.
引用
收藏
页码：207 / 215
页数：9
相关论文
共 50 条
  • [21] Edge-partitioning 3-edge-connected graphs into paths
    Klimosova, Tereza
    Thomasse, Stephan
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2022, 156 : 250 - 293
  • [22] GROUP CONNECTIVITY IN 3-EDGE-CONNECTED SIGNED GRAPHS
    Castano, Alejandra brewer
    Mcdonald, Jessica
    Nurse, Kathryn
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2025, 39 (01) : 388 - 412
  • [23] Group connectivity of 3-edge-connected chordal graphs
    Lai, HJ
    GRAPHS AND COMBINATORICS, 2000, 16 (02) : 165 - 176
  • [24] Connectivity keeping trees in 3-connected or 3-edge-connected graphs
    Liu, Haiyang
    Liu, Qinghai
    Hong, Yanmei
    DISCRETE MATHEMATICS, 2023, 346 (12)
  • [25] Spanning Even Subgraphs of 3-Edge-Connected Graphs
    Jackson, Bill
    Yoshimoto, Kiyoshi
    JOURNAL OF GRAPH THEORY, 2009, 62 (01) : 37 - 47
  • [26] Group Connectivity of 3-Edge-Connected Chordal Graphs
    Hong-Jian Lai
    Graphs and Combinatorics, 2000, 16 (2) : 165 - 176
  • [27] Faster Computation of 3-Edge-Connected Components in Digraphs
    Georgiadis, Loukas
    Kipouridis, Evangelos
    Papadopoulos, Charis
    Parotsidis, Nikos
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2489 - 2531
  • [28] A (FORGOTTEN) UPPER BOUND FOR THE SPECTRAL RADIUS OF A GRAPH
    Elphick, Clive
    Liu, Chia-An
    TAIWANESE JOURNAL OF MATHEMATICS, 2015, 19 (06): : 1593 - 1602
  • [29] Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
    Yang, Qing
    Tian, Yingzhi
    DISCRETE MATHEMATICS, 2024, 347 (05)
  • [30] 3-EDGE-CONNECTED EMBEDDINGS HAVE FEW SINGULAR EDGES
    BENDER, EA
    RICHMOND, LB
    JOURNAL OF GRAPH THEORY, 1990, 14 (04) : 475 - 477
12345