Cubic and quadruple Paley graphs with the n-e.c. property
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3912417 (Why is no real title available?)
- scientific article; zbMATH DE number 554162 (Why is no real title available?)
- A note on constructing digraphs with prescribed properties
- A note on graphs with a prescribed adjacency property
- 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
- On an adjacency property of graphs
- On the adjacency properties of generalized Paley graphs
- On the adjacency properties of paley graphs
- Paley graphs satisfy all first-order adjacency axioms
Cited in
(11)- The search for N-e.c. Graphs
- On explicit random-like tournaments
- Ample simplicial complexes
- Paley-type graphs of order a product of two distinct primes
- A strongly regular \(n\)-full graph of small order
- A generalization of generalized Paley graphs and new lower bounds for \(R(3,q)\)
- Cliques of orders three and four in the Paley-type graphs
- scientific article; zbMATH DE number 166086 (Why is no real title available?)
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- On a Paley-type graph on \({\mathbb{Z}}_n\)
- On the adjacency properties of generalized Paley graphs
This page was built for publication: Cubic and quadruple Paley graphs with the \(n\)-e.c. property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860460)