On the conjecture for the girth of the bipartite graph D(k,q)
From MaRDI portal
(Redirected from Publication:297945)
On the conjecture for the girth of the bipartite graph \(D(k,q)\)
On the conjecture for the girth of the bipartite graph \(D(k,q)\)
Recommendations
- On the girth of the bipartite graph D(k, q)
- On the girth cycles of the bipartite graph \(D(k, q)\)
- New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles
- On the connectivity of certain graphs of high girth.
- On the characterization of some algebraically defined bipartite graphs of girth eight
Cites work
- A characterization of the components of the graphs \(D(k,q)\)
- A new series of dense graphs of high girth
- An infinite series of regular edge- but not vertex-transitive graphs
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Explicit construction of graphs with an arbitrary large girth and of large size
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Extremal properties of regular and affine generalized m-gons as tactical configurations
- General properties of some families of graphs defined by systems of equations
- Graphs of prescribed girth and bi-degree
- New examples of graphs without small cycles and of large size
- New upper bounds on the order of cages
- On monomial graphs of girth eight
- On small world semiplanes with generalised Schubert cells
- On the connectivity of certain graphs of high girth.
- On the girth of the bipartite graph D(k, q)
- On the homogeneous algebraic graphs of large girth and their applications
Cited in
(9)- New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles
- A characterization of the components of the graphs \(D(k,q)\)
- Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
- On the bipartite density of regular graphs with large girth
- On the girth of the bipartite graph D(k, q)
- 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 eigenvalues of the graphs D(5,q)
This page was built for publication: On the conjecture for the girth of the bipartite graph \(D(k,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297945)
