Skip to main content

On a class of edge-regular graphs

Part II: Contributed Papers

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

Abstract

A regular graph is 4-regular if any two vertices at distance one resp. two have exactly λ resp. μ common neighbours. Some parameter relations are proved, and certain extremal cases of 4-regular graphs are classified. In particular, we obtain a characterization of double covers of complete graphs related to regular twographs.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.L. Biggs, Algebraic graph theory. Cambridge Univ. Press, 1974.

    Google Scholar 

  2. N.L. Biggs, Automorphic graphs and the Krein condition, Geometriae Dedicata 5 (1976), 117–127.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. P.J. Cameron, Biplanes, Math. Z. 131 (1973), 85–101.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. P.J. Cameron, personal communication.

    Google Scholar 

  5. X. Hubaut, Strongly regular graphs, Discrete Math. 13 (1975), 357–381.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. A. Neumaier, Strongly regular graphs with smallest eigenvalue-m, Arch. Math. 33 (1979), 392–400.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. A. Neumaier, Rectagraphs, diagrams, and Suzuki's sporadic simple group, Ann. Discrete Math., to appear.

    Google Scholar 

  8. A. Neumaier, Classification of graphs by regularity, J. Combin. Theory B, to appear.

    Google Scholar 

  9. M. Perkel, Bounding the valency of polygonal graphs with odd girth, Can. J. Math. 31 (1979), 1307–1321.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. J.J. Seidel, Strongly regular graphs, an introduction. In: Surveys in Combinatorics, Cambridge Univ. Press 1979, pp. 157–180.

    Google Scholar 

  11. D.E. Taylor, Regular twographs, Proc. London Math. Soc. (3) 35 (1977), 257–274.

    CrossRef  MathSciNet  Google Scholar 

  12. D.E. Taylor and R. Levingston, Distance-regular graphs, Lecture Notes in Mathematics 686, pp. 313–323.

    Google Scholar 

  13. P. Wild, Semibiplanes, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Neumaier, A. (1981). On a class of edge-regular graphs. In: Aigner, M., Jungnickel, D. (eds) Geometries and Groups. Lecture Notes in Mathematics, vol 893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091023

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11166-5

  • Online ISBN: 978-3-540-38639-1

  • eBook Packages: Springer Book Archive