Adjacency matrices of polarity graphs and of other C₄-free graphs of large size
From MaRDI portal
Publication:970541
Recommendations
Cites work
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 3421490 (Why is no real title available?)
- Cages—a survey
- Dynamic cage survey
- Graph theory
- Graphs of diameter two with no 4-circuits
- Graphs without four-cycles
- Graphs without quadrilaterals
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
- On Graphs that do not Contain a Thomsen Graph
- On the number of edges of quadrilateral-free graphs
- Polarities in finite projective planes
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)