Abstract.
It is shown, among other results, that for any prime power q, the complete graph on 1+q+q 2+q 3 vertices can be decomposed into a union of 1+q Siamese Strongly Regular Graphs S R G(1+q+q 2+q 3,q+q 2,q−1,q+1) sharing 1+q 2 cliques of size 1+q.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Acknowledgments. The authors are indebted to a referee for a very extensive report and for many suggestions which improved the presentation of the paper tremendously.
AMS Subject Numbers: 05B05, 05B20, 05E30
This work was completed while the first author was on sabbatical leave visiting Institute for studies in theoretical Physics and Mathematics, (IPM), in Tehran, Iran. Support and hospitality is appreciated. Supported by an NSERC operating grant.
Rights and permissions
About this article
Cite this article
Kharaghani, H., Torabi, R. On a Decomposition of Complete Graphs. Graphs and Combinatorics 19, 519–526 (2003). https://doi.org/10.1007/s00373-003-0527-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-003-0527-y