On the girth of the bipartite graph \(D(k, q)\)
From MaRDI portal
Publication:400434
DOI10.1016/j.disc.2014.07.004zbMath1298.05227MaRDI QIDQ400434
Xiaoyan Cheng, Wenbing Chen, Yuansheng Tang
Publication date: 21 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.004
05C35: Extremal problems in graph theory
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Girth of the algebraic bipartite graph \(D(k,q)\), A simple proof for the lower bound of the girth of graphs \(D(n,q)\), On the girth cycles of the bipartite graph \(D(k, q)\), On the conjecture for the girth of the bipartite graph \(D(k,q)\), Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
Cites Work
- On the homogeneous algebraic graphs of large girth and their applications
- On the diameter of Wenger graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Polarities and \(2k\)-cycle-free graphs
- New examples of graphs without small cycles and of large size
- On the connectivity of certain graphs of high girth.
- Explicit construction of graphs with an arbitrary large girth and of large size
- Graphs of prescribed girth and bi-degree
- A characterization of the components of the graphs \(D(k,q)\)
- On monomial graphs of girth eight
- On small world semiplanes with generalised Schubert cells
- General properties of some families of graphs defined by systems of equations
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- A new series of dense graphs of high girth
- Isomorphism criterion for monomial graphs
- An infinite series of regular edge- but not vertex-transitive graphs
