ISSN 0253-2778

CN 34-1054/N

open
Open AccessOpen Access JUSTC

The wide-diameter of regular graphs

Cite this: JUSTC, 2013, 43(8): 603-606
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: December 19, 2012
  • Revised Date: May 21, 2013
  • Published Date: August 30, 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.

Catalog

    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML

    Article Metrics

    Article views (306) PDF downloads (187)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return