Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-23T08:04:59.821Z Has data issue: false hasContentIssue false
  • English
  • Français

On the relationship between graphs and partially balanced incomplete block designs

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.

Certain theorems which are already known show that if a partially balanced incomplete block design with suitable parameters exists then there is a (V, K, Λ)-graph. We prove that the existence of such a graph is in fact equivalent to the existence of a certain partially balanced design. The known necessary conditions for (V, K, Λ)-graphs then follow from well-known necessary conditions for designs.

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

References

[1]Ahrens, R.W. and Szekeres, G., “On a combinatorial generalization of 27 lines associated with a cubic surface”, J. Austral. Math. Soc. (to appear).Google Scholar
[2]Bose, R.C., “Strongly regular graphs, partial geometries and partially balanced designs”, Pacific J. Math. 13 (1963), 389–49.Google Scholar
[3]Bose, R.C. and Clatworthy, W.H., “Some classes of partially balanced designs”, Ann. Math. Statist. 26 (1955), 212–232.CrossRefGoogle Scholar
[4]Bose, R.C. and Shrikhande, S.S., Graphs in which eaah pair of vertices is adjacent to the same number d of other vertices (Institute of Statistics Mimeo Series No. 600.6, Consolidated University of North Carolina, 1969).Google Scholar
[5]Clatworthy, Willard H., “A geometrical configuration which is a partially balanced incomplete block design”, Proc, Amer. Math. Soc. 5 (1954), 47–55.CrossRefGoogle Scholar
[6]Connor, W.S. and Clatworthy, W.H., “Some theorems for partially balanced designs”, Ann. Math. Statist. 25 (1954), 100–112.CrossRefGoogle Scholar
[7]Ray-Chaudhuri, D.K., “Application of the geometry of quadrics for constructing P B I B designs”, Ann. Math. Statist. 33 (1962), 1175–1186.CrossRefGoogle Scholar
[8]Sauer, Norbert, “(v,k,λ)-graphs” (Calgary International Conference on Combinatorial Structures and their Applications, Abstracts, University of Calgary, 1969).Google Scholar
[9]Shrikhande, S.S. and Singh, N.K., “On a method of constructing symmetrical balanced incomplete block designs”, Sankhyā, Ser. A 24 (1962), 25–32.Google Scholar
[10]Wallis, W.D., “Certain graphs arising from Hadamard matrices”, Bull. Austral. Math. Soc. 1 (1969), 325–331.CrossRefGoogle Scholar
[11]Wallis, W.D., “A non-existence theorem for (v,k, λ)-graphs”, J. Austral. Math. Soc. (to appear).Google Scholar