Explicit construction of regular graphs without small cycles

DOI10.1007/BF02579157zbMath0535.05033MaRDI QIDQ790830

Wilfried Imrich

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsgirth

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (20)

Colouring graphs with forbidden bipartite subgraphs ⋮ On a pursuit game on Cayley graphs ⋮ Cops and robbers in graphs with large girth and Cayley graphs ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ Ramanujan graphs ⋮ Weak degeneracy of graphs ⋮ A new series of dense graphs of high girth ⋮ Low-distortion embeddings of graphs with large girth ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Regular graphs of large girth and arbitrary degree ⋮ On the girth of infinite graphs ⋮ Triples and hexagons ⋮ Keyed hash function from large girth expander graphs ⋮ Exponentially many perfect matchings in cubic graphs ⋮ On the girth of random Cayley graphs ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ The second eigenvalue of regular graphs of given girth ⋮ Conformal growth rates and spectral geometry on distributional limits of graphs ⋮ Kissing numbers of regular graphs ⋮ Turán problems for integer-weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit constructions of graphs without short cycles and low density codes

This page was built for publication: Explicit construction of regular graphs without small cycles