Cubic and quadruple Paley graphs with the \(n\)-e.c. property

DOI10.1016/j.disc.2006.03.073zbMath1107.05078OpenAlexW1979665574MaRDI QIDQ860460

Louis Caccetta, Watcharaphong Ananchuen

Publication date: 9 January 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.073

zbMATH Keywords

Paley graphadjacency propertyPaley digraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (5)

Descriptive complexity of graph spectra ⋮ On explicit random-like tournaments ⋮ Unnamed Item ⋮ On a Paley-type graph on \({\mathbb{Z}}_n\) ⋮ Ample simplicial complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A prolific construction of strongly regular graphs with the \(n\)-e. c. property
• Equations over finite fields. An elementary approach
• Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
• Paley graphs satisfy all first-order adjacency axioms
• On an adjacency property of graphs
• A note on graphs with a prescribed adjacency property
• On the adjacency properties of paley graphs

This page was built for publication: Cubic and quadruple Paley graphs with the \(n\)-e.c. property