Skip to main content

The Hamiltonian product of graphs

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics

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

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
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. Harary, F., “Graph Theory”, Addison-Wesley (1969).

    Google Scholar 

  2. Holton, D.A., “The groups of the graphs of type A2”, Pure Maths. Pre-print Ho. 1, Univ. of Melb. (1971).

    Google Scholar 

  3. Wallis, W.D., “Certain graphs arising from Hadamard matrices”, Bull Aust. Math. Soc., 1. (1969), 325–332.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Derek A. Holton

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Peckham, I.A. (1974). The Hamiltonian product of graphs. In: Holton, D.A. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057380

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06903-4

  • Online ISBN: 978-3-540-37837-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics