Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
From MaRDI portal
Publication:970541
DOI10.1007/s10623-010-9364-1zbMath1214.05075OpenAlexW2068915011MaRDI QIDQ970541
Camino Balbuena, Marién Abreu, Domenico 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
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Incidence structures embeddable into projective geometries (51A45)
Related Items (7)
Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Ramsey numbers of \(C_4\) versus wheels and stars ⋮ Families of small regular graphs of girth 5 ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ Extremal graphs without 4-cycles ⋮ Optimal monomial quadratization for ODE systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs of diameter two with no 4-circuits
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- Dynamic cage survey
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- Graphs without four-cycles
- Cages—a survey
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
- On Graphs that do not Contain a Thomsen Graph
- Polarities in finite projective planes
This page was built for publication: Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size