ISSN 0253-2778

CN 34-1054/N

Open AccessOpen Access JUSTC

The wide-diameter of regular graphs

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2013.08.001
More Information
  • Author Bio:

    LI Jiaao, male, born in 1990, master. Research field: Combinatorics and graph theory. E-mail: lijiaao@mail.ustc.edu.cn

  • Corresponding author: XU Junming
  • Received Date: 20 December 2012
  • Rev Recd Date: 22 May 2013
  • Publish Date: 31 August 2013
  • The diameter with width m of a graph G is defined as the minimum integer d for which between any two distinct vertices in G there exist at least m internally disjoint paths of length of at most d. It was shown that the tight upper bound on m-diameter of w-regular w-connected graph with order n is(n-2)(w-2)[](w-m+1)(3m-w-4)+1 for any integer m with 2w+5[]3≤m≤w. Some known results can be deduced or improved from the obtained result.
    The diameter with width m of a graph G is defined as the minimum integer d for which between any two distinct vertices in G there exist at least m internally disjoint paths of length of at most d. It was shown that the tight upper bound on m-diameter of w-regular w-connected graph with order n is(n-2)(w-2)[](w-m+1)(3m-w-4)+1 for any integer m with 2w+5[]3≤m≤w. Some known results can be deduced or improved from the obtained result.
  • loading
  • 加载中

Catalog

    Article Metrics

    Article views (222) PDF downloads(100)
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return