Maximal cliques in the Paley graph of square order

DOI10.1016/S0378-3758(96)00006-7zbMath0876.05093OpenAlexW1985669273WikidataQ56853018 ScholiaQ56853018MaRDI QIDQ1361698

Gary L. Ebert, Andrew J. Woldar, Ronald D. Baker, Joe Hemmeter

Publication date: 9 September 1997

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(96)00006-7

zbMATH Keywords

Paley graphclique numbermaximal cliquessquare order

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (11)

On a correspondence between maximal cliques in Paley graphs of square order ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ On eigenfunctions and maximal cliques of Paley graphs of square order ⋮ On maximal cliques of Cayley graphs over fields ⋮ On eigenfunctions and maximal cliques of generalised Paley graphs of square order ⋮ Weakly Hadamard diagonalizable graphs ⋮ On the independence ratio of distance graphs ⋮ Deza graphs with parameters and ⋮ Unnamed Item ⋮ Maximal integral point sets in affine planes over finite fields ⋮ Some colouring problems for Paley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of complete exterior sets of conics
• Finite nets. II: Uniqueness and imbedding
• CLIQUE NUMBERS OF PALEY GRAPHS
• Generalized quadratic residue codes
• On Orthogonal Matrices

This page was built for publication: Maximal cliques in the Paley graph of square order