On the conjecture for the girth of the bipartite graph \(D(k,q)\)
From MaRDI portal
Publication:297945
DOI10.1016/j.disc.2016.03.018zbMath1338.05132OpenAlexW2369729588WikidataQ122947074 ScholiaQ122947074MaRDI QIDQ297945
Wenbing Chen, Xiaoyan Cheng, Yuansheng Tang
Publication date: 20 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.03.018
bipartite graphbinomial coefficientedge-transitive graphgirth cyclenon-recurrent circuitnon-recurrent walk
Related Items (4)
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)\) ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
Cites Work
- On the girth of the bipartite graph \(D(k, q)\)
- On the homogeneous algebraic graphs of large girth and their applications
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- New examples of graphs without small cycles and of large size
- New upper bounds on the order of cages
- On the connectivity of certain graphs of high girth.
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
- 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
- An infinite series of regular edge- but not vertex-transitive graphs
This page was built for publication: On the conjecture for the girth of the bipartite graph \(D(k,q)\)
