On a decomposition of complete graphs

DOI10.1007/s00373-003-0527-yzbMath1032.05008OpenAlexW2045559318MaRDI QIDQ1423497

Reza Torabi, Hadi Kharaghani

Publication date: 4 March 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-003-0527-y

zbMATH Keywords

Symmetric designComplete graphStrongly regular graphDifference setBalanced generalized weighing matrix

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (3)

Non-commutative association schemes and their fusion association schemes ⋮ Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes ⋮ Linked systems of symmetric group divisible designs of type. II

This page was built for publication: On a decomposition of complete graphs