Skip to main content

Graphs with regular neighbourhoods

Contributed Papers

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

Abstract

We call a graph G NR-regular if, for each vertex v of G, the subgraphs of G induced by the vertices adjacent to v and by the vertices not adjacent or equal to v are regular. NR-regular graphs which are regular, disconnected or have disconnected complements are easily classified, and will be called trivial. Those of the first type are just the strongly regular graphs.

We show that non-trivial NR-regular graphs exist and have considerable structure. For example, there are only two vertex degrees, and the vertices of each degree induce a regular subgraph of G. The eigenvalues of each of these subgraphs determine the eigenvalues of the other. We are able to construct non-trivial NR-regular graphs with 4, 8, 28 and 32 vertices, and conjecture that there are infinitely many more.

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   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
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, Finite Groups of Automorphisms, Lecture Notes 6, London Math. Soc. (Cambridge University Press, Cambridge, 1971).

    MATH  Google Scholar 

  2. F.C. Bussemaker, D.M. Cvetković and J.J. Seidel, Graphs Related to Exceptional Root Systems, Techn. Univ. Eindhoven, Dept. of Math. Research Report T.H.-76-WSK-05, (1976).

    Google Scholar 

  3. S.S. Shrikhande, The uniqueness of the L2 association scheme, Ann. Math. Statist. 30 (1959) 781–798.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Godsil, C.D., McKay, B.D. (1980). Graphs with regular neighbourhoods. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088906

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10254-0

  • Online ISBN: 978-3-540-38376-5

  • eBook Packages: Springer Book Archive