ON THE K-DIAMETER OF K-REGULAR K-CONNECTED GRAPHS

被引:1
|
作者
HSU, DF
LUCZAK, T
机构
[1] ADAM MICKIEWICZ UNIV POZNAN,DEPT DISCRETE MATH,PL-60769 POZNAN,POLAND
[2] FORDHAM UNIV,DEPT COMP & INFORMAT SCI,BRONX,NY 10458
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n vertices has k-diameter at most n/2 and this upper bound cannot be improved when n = 4k - 6 + i(2k - 4). In particular, the maximal 3-diameter of 3-regular graphs with 2n vertices is equal to n.
引用
收藏
页码:291 / 296
页数:6
相关论文
共 50 条
  • [1] On generalized k-diameter of k-regular k-connected graphs
    Hou, XM
    Wang, TM
    [J]. TAIWANESE JOURNAL OF MATHEMATICS, 2004, 8 (04): : 739 - 745
  • [2] An algorithm to construct k-regular k-connected graphs with the maximum k-diameter
    Hou, XM
    Liu, BL
    Wang, TM
    [J]. GRAPHS AND COMBINATORICS, 2003, 19 (01) : 111 - 119
  • [3] An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter
    Xinmin Hou
    Bolian Liu
    Tianming Wang
    [J]. Graphs and Combinatorics, 2003, 19 : 111 - 119
  • [4] ON k-DIAMETER OF k-CONNECTED GRAPHS
    Xu Junming Xu Keli of Math.
    [J]. Applied Mathematics:A Journal of Chinese Universities, 2001, (03) : 231 - 236
  • [5] On k-diameter of k-connected graphs
    Xu J.
    Xu K.
    [J]. Applied Mathematics-A Journal of Chinese Universities, 2001, 16 (3) : 231 - 236
  • [6] K K,K IS (K-1, 1)-CRITICAL FOR K-REGULAR K-CONNECTED GRAPHS
    ALDRED, REL
    JIA, RZ
    [J]. ARS COMBINATORIA, 1988, 26B : 247 - 248
  • [7] Circuits through prescribed vertices in k-connected k-regular graphs
    Häggkvist, R
    Mader, W
    [J]. JOURNAL OF GRAPH THEORY, 2002, 39 (02) : 145 - 163
  • [8] Application of k-regular and k-connected protection structure in optical networks
    Li, Xin
    Zhang, Jie
    Huang, Shan-Guo
    Zhao, Yong-Li
    Gu, Wan-Yi
    [J]. Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2013, 36 (05): : 76 - 80
  • [9] SPECTRAL DIAMETER ESTIMATES FOR K-REGULAR GRAPHS
    QUENELL, G
    [J]. ADVANCES IN MATHEMATICS, 1994, 106 (01) : 122 - 148
  • [10] ON THE CYCLABILITY OF K-CONNECTED (K+1)-REGULAR GRAPHS
    HOLTON, DA
    PLUMMER, MD
    [J]. ARS COMBINATORIA, 1987, 23 : 37 - 55