Skip to main content
SpringerLink
Log in

An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let f(2m,k) be the Maximum k-diameter of k-regular k-connected graphs on 2m vertices. In this paper we give an algorithm and prove that we can construct k-regular k-connected graphs on 2m vertices with the maximum k-diameter using it. We also prove some known results about f(2m,k) and verify that we can get some unknown values of f(2m,k) by our algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Science and Technology of China, Hefei 230026, China. e-mail: xmhou@ustc.edu.cn, , , , , , CN

    Xinmin Hou

  2. Department of Mathematics, South China Normal University, Guangzhou 510631, China. e-mail: liubl@scnu.edu.cn, , , , , , CN

    Bolian Liu

  3. Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China. e-mail: wangtm@dlut.edu.cn, , , , , , CN

    Tianming Wang

Authors
  1. Xinmin Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bolian Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tianming Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 1, 2000 Final version received: March 12, 2002

Acknowledgments. We thank the referee for many useful suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hou, X., Liu, B. & Wang, T. An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. Graphs and Combinatorics 19, 111–119 (2003). https://doi.org/10.1007/s00373-002-0488-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0488-6

Search

Navigation