Detour-saturated graphs

被引:5
|
作者
Beineke, LW [1 ]
Dunbar, JE
Frick, M
机构
[1] Indiana Univ Purdue Univ, Ft Wayne, IN 46805 USA
[2] Converse Coll, Spartanburg, SC 29302 USA
[3] Univ S Africa, Unisa, South Africa
关键词
longest path; detour; detour-saturated; unicyclic;
D O I
10.1002/jgt.20069
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A graph is said to be detour-saturated if the addition of any edge results in an increased greatest path length. In this paper, we add to the relatively small amount that is known about detour-saturated graphs. Our main result is a determination of all connected detour-saturated graphs with exactly one cycle. (The family of detour-saturated trees was found by Kaszonyi and Tuza [7].) We also show that the smallest detour-saturated graph of girth 5 is the graph obtainable from the Petersen graph by splitting one of its vertices into three, each of degree 1. (c) 2005 Wiley Periodicals, Inc.
引用
收藏
页码:116 / 134
页数:19
相关论文
共 50 条
  • [41] Hamilton-connectivity of line graphs with application to their detour index
    Yubin Zhong
    Sakander Hayat
    Asad Khan
    Journal of Applied Mathematics and Computing, 2022, 68 : 1193 - 1226
  • [42] CLIQUE-TO-CLIQUE TRIANGLE FREE DETOUR DISTANCE IN GRAPHS
    Asir, I. Keerthi
    Athisayanathan, S.
    ARS COMBINATORIA, 2019, 146 : 323 - 340
  • [43] Maximum Detour Index of Unicyclic Graphs with Given Maximum Degree
    Qi, Xuli
    Zhou, Bo
    ARS COMBINATORIA, 2011, 102 : 193 - 200
  • [44] Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs
    Honma, Hirotoshi
    Nakajima, Yoko
    Igarashi, Yuta
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (06): : 1365 - 1369
  • [45] The restricted detour polynomials of a prism and some wheel related graphs
    Abdullah, Herish Omer
    Ali, Ivan Dler
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2021, 42 (04): : 773 - 784
  • [46] Hamilton-connectivity of line graphs with application to their detour index
    Zhong, Yubin
    Hayat, Sakander
    Khan, Asad
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2022, 68 (02) : 1193 - 1226
  • [47] Weakly saturated random graphs
    Bartha, Zsolt
    Kolesnik, Brett
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (01) : 131 - 148
  • [48] On (Kt - e)-Saturated Graphs
    Fuller, Jessica
    Gould, Ronald J.
    GRAPHS AND COMBINATORICS, 2018, 34 (01) : 85 - 95
  • [49] ASYMPTOTIC RESULTS ON SATURATED GRAPHS
    TRUSZCZYNSKI, M
    TUZA, Z
    DISCRETE MATHEMATICS, 1991, 87 (03) : 309 - 314
  • [50] On Ramsey unsaturated and saturated graphs
    Ho, Pak
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 46 : 13 - 18