On the connectivity of certain graphs of high girth.

DOI10.1016/j.disc.2003.08.003zbMath1033.05068OpenAlexW2037725935MaRDI QIDQ1426127

Felix Lazebnik, Raymond Viglione

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.08.003

zbMATH Keywords

ConnectivityAlgebraic constructionsDense graphsHigh girth

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

On the conjecture for the girth of the bipartite graph \(D(k,q)\) ⋮ 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)\) ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ On monomial graphs of girth eight ⋮ Role colouring graphs in hereditary classes

Uses Software

• GADAR

Cites Work

• Unnamed Item
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Ramanujan graphs
• Explicit construction of graphs with an arbitrary large girth and of large size
• A characterization of the components of the graphs \(D(k,q)\)
• General properties of some families of graphs defined by systems of equations
• A new series of dense graphs of high girth
• An infinite series of regular edge- but not vertex-transitive graphs