Certain 3-decompositions of complete graphs, with an application to finite fields

DOI10.1017/S0308210500014293zbMath0562.05044MaRDI QIDQ5187325

Peter Rowlinson

Publication date: 1985

Published in: Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionstrongly regular graphfinite fieldcomplete graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Polynomials over finite fields (11T06) Graph theory (05C99)

Related Items (4)

Signed graphs with at most three eigenvalues ⋮ Some implications on amorphic association schemes ⋮ Eigenvalues and clique partitions of graphs ⋮ Strongly regular decompositions of the complete graph

Cites Work

• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• A New Family of Partially Balanced Incomplete Block Designs with Some Latin Square Design Properties
• On the Number of Solutions of Some Trinomial Equations in a Finite Field

This page was built for publication: Certain 3-decompositions of complete graphs, with an application to finite fields