Cubic and quadruple Paley graphs with the n-e.c. property
From MaRDI portal
Publication:860460
DOI10.1016/J.DISC.2006.03.073zbMATH Open1107.05078OpenAlexW1979665574MaRDI QIDQ860460FDOQ860460
Authors: W. Ananchuen, Louis Caccetta 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the adjacency properties of paley graphs
- Equations over finite fields. An elementary approach
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Title not available (Why is that?)
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- On the adjacency properties of generalized Paley graphs
- A note on constructing digraphs with prescribed properties
- Paley graphs satisfy all first-order adjacency axioms
- On an adjacency property of graphs
- Title not available (Why is that?)
- A note on graphs with a prescribed adjacency property
Cited In (12)
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Ample simplicial complexes
- 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
- Title not available (Why is that?)
- The search for N-e.c. Graphs
- On explicit random-like tournaments
- Paley-type graphs of order a product of two distinct primes
- On a Paley-type graph on \({\mathbb{Z}}_n\)
- On the adjacency properties of generalized Paley graphs
- Descriptive complexity of graph spectra
- A strongly regular \(n\)-full graph of small order
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)
