Skip to main content
SpringerLink
Log in

Distance degrees of vertex-transitive graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In [4], a lower bound of distance degrees of distance degree regular graphs is obtained. In this paper, we prove that a lower bound will be improved in some cases of vertex-transitive graphs.

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

References

  1. Biggs, N.: Algebraic Graph Theory. Camb. Tracts Math. No. 67. Cambridge: Cambridge University Press 1974

    Google Scholar 

  2. Harary, F.: Graph Theory. Reading: Addison-Wesley 1969

    Google Scholar 

  3. Hilano, T. Regular Graphs with Regular Squares (unpublished)

  4. Hilano, T., Nomura, K.: Distance degree regular graphs. J. Comb. Theory (B)37, 96–100 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Technology, Kanagawa Institute of Technology, 243-02, Atsugi, Kanagawa, Japan

    Teluhiko Hilano

Authors
  1. Teluhiko Hilano
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hilano, T. Distance degrees of vertex-transitive graphs. Graphs and Combinatorics 5, 223–228 (1989). https://doi.org/10.1007/BF01788674

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788674

Keywords

Search

Navigation