Skip to main content
SpringerLink
Log in

Graphs with unique walks, trails or paths of given lengths

  • Conference paper
  • First Online:
Theory and Applications of Graphs

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 642))

Abstract

In this paper we consider directed, undirected, or mixed graphs G. We also assume that for any two vertices u and v of G there exists exactly one walk [trail, path] from u to v whose length is in a given interval. Mixed Moore graphs (as special kinds of such graphs) are also studied. It is shown that there exist infinitely many mixed Moore graphs of diameter two. Some of the proofs are indicated and some will be published elsewhere.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bannai and T. Ito, On finite Moore graphs. J. Fac. Sci. Univ. Tokyo Sect. I A Math. 20 (1973) 191–208.

    MathSciNet  MATH  Google Scholar 

  2. C. T. Benson and N. E. Losey, On a graph of Hoffman and Singleton. J. Combinatorial Theory Ser. B 11 (1971) 67–79.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Bosák, On the k-index of graphs. Discrete Math. 1 (1971) 133–146.

    Article  MathSciNet  MATH  Google Scholar 

  4. J. Bosák, A. Kotzig, and S. Znám, Strongly geodetic graphs, J. Combinatorial Theory 5 (1968) 170–176.

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Damerell, On Moore graphs, Proc. Cambridge Philos. Soc. 74 (1973) 227–236.

    Article  MathSciNet  MATH  Google Scholar 

  6. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass. (1969).

    Google Scholar 

  7. A. J. Hoffman and R. R. Singleton, On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4 (1960) 497–504.

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Plesník, One method for proving the impossibility of certain Moore graphs. Discrete Math. 8 (1974) 363–376.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Plesník and S. Znám, Strongly geodetic directed graphs. Acta Fac. Rerum Natur. Univ. Comenian. Math. 29 (1974) 29–34.

    MathSciNet  MATH  Google Scholar 

  10. W. T. Tutte, Connectivity in Graphs. Toronto Univ. Press, Tronto (1966).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institue of the Slovak Academy of Sciences, Bratislava, Czechoslovakia

    Juraj Bosák

Authors
  1. Juraj Bosák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bosák, J. (1978). Graphs with unique walks, trails or paths of given lengths. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070366

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation