Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-27T19:48:29.636Z Has data issue: false hasContentIssue false
  • English
  • Français

Certain graphs arising from Hadamard matrices

Published online by Cambridge University Press:  17 April 2009

W.D. Wallis
W.D. Wallis
Affiliation:
La Trobe University, Bundoora, Victoria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We establish several infinite classes of regular graphs with the property that any two distinct vertices have a fixed number of other vertices joined to both of them. The graphs are found by constructing their incidence matrices, which correspond to certain Hadamard matrices.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 1 , Issue 3 , December 1969 , pp. 325 - 331
Copyright
Copyright © Australian Mathematical Society 1969

References

[1]Ahrens, R.W. and Szekeres, G., “On a combinatorial generalization of twenty-seven lines associated with a cubic surface”, J. Austral. Math. Soc. (to appear).Google Scholar
[2]Hall, Marshall Jr, Combinatorial theory (Blaisdell, Waltham, Massachusetts, 1967).Google Scholar
[3]Wallis, Jennifer, “Two new block designs”, J. Combinatorial Theory (to appear).Google Scholar