A characterization of the components of the graphs \(D(k,q)\)
From MaRDI portal
Publication:1924372
DOI10.1016/S0012-365X(96)83019-6zbMath0861.05051MaRDI QIDQ1924372
Felix Lazebnik, Andrew J. Woldar, Vasiliy A. Ustimenko
Publication date: 4 May 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
05C75: Structural characterization of families of graphs
Related Items
On the homogeneous algebraic graphs of large girth and their applications, Polarities and \(2k\)-cycle-free graphs, On the connectivity of certain graphs of high girth., Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations, General properties of some families of graphs defined by systems of equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- New examples of graphs without small cycles and of large size
- Explicit construction of graphs with an arbitrary large girth and of large size
- Graphs of prescribed girth and bi-degree
- A new series of dense graphs of high girth