Adjacency matrices of polarity graphs and of other C₄-free graphs of large size
DOI10.1007/S10623-010-9364-1zbMATH Open1214.05075OpenAlexW2068915011MaRDI QIDQ970541FDOQ970541
Authors: C. Balbuena, M. Abreu, D. Labbate 
Publication date: 19 May 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9364-1
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Incidence structures embeddable into projective geometries (51A45)
Cites Work
- Graph theory
- Title not available (Why is that?)
- On Graphs that do not Contain a Thomsen Graph
- Title not available (Why is that?)
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- Dynamic cage survey
- Polarities in finite projective planes
- Cages—a survey
- Graphs without four-cycles
- Title not available (Why is that?)
- Graphs of diameter two with no 4-circuits
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
Cited In (7)
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Optimal monomial quadratization for ODE systems
- Families of small regular graphs of girth 5
- Ramsey numbers of \(C_4\) versus wheels and stars
- Orthogonal polarity graphs and Sidon sets
- Extremal graphs without 4-cycles
This page was built for publication: Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970541)
