On the adjacency properties of paley graphs

DOI10.1002/net.3230230404zbMath0777.05095OpenAlexW2084692244MaRDI QIDQ5289365

Louis Caccetta, Watcharaphong Ananchuen

Publication date: 23 August 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230404

zbMATH Keywords

Paley graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Finite fields and commutative rings (number-theoretic aspects) (11T99) Graph theory (05C99)

Related Items (12)

Cubic and quadruple Paley graphs with the \(n\)-e.c. property ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ A note on graphs with a prescribed adjacency property ⋮ Private simultaneous messages based on quadratic residues ⋮ Irreducible nonmetrizable path systems in graphs ⋮ On an adjacency property of almost all tournaments ⋮ Unnamed Item ⋮ Graphs with the \(n\)-e.c. adjacency property constructed from affine planes ⋮ Covering arrays from cyclotomy ⋮ Further results on existentially closed graphs arising from block designs ⋮ On a Paley-type graph on \({\mathbb{Z}}_n\) ⋮ Some colouring problems for Paley graphs

Cites Work

• Equations over finite fields. An elementary approach
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• HOW TO DESCRIBE A GRAPH

This page was built for publication: On the adjacency properties of paley graphs