论文信息 - On a Decomposition of Complete Graphs

On a Decomposition of Complete Graphs

Abstract.It is shown, among other results, that for any prime power q, the complete graph on 1+q+q2+q3 vertices can be decomposed into a union of 1+q Siamese Strongly Regular Graphs SRG(1+q+q2+q3,q+q2,q−1,q+1) sharing 1+q2 cliques of size 1+q.

Hadi Kharaghani | Rouzbeh Torabi | H. Kharaghani | R. Torabi

[1] Peter J. Cameron,et al. Strongly regular graphs , 2003 .

[2] Yury J. Ionin. A Technique for Constructing Symmetric Designs , 1998, Des. Codes Cryptogr..

[3] Hanfried Lenz,et al. Design theory , 1985 .

[4] Gerald Berman. Families of generalized weighing matrices , 1978 .

[5] Rudolf Mathon,et al. Construction methods for Bhaskar Rao and related designs , 1987 .

[6] Hadi Kharaghani. On the Twin Designs with the Ionin-type Parameters , 2000, Electron. J. Comb..

[7] Yury J. Ionin. New Symmetric Designs from Regular Hadamard Matrices , 1997, Electron. J. Comb..

[8] H. Kharaghani. On the Siamese Twin Designs , 2001 .