Symmetrical path-cycle covers of a graph and polygonal graphs

DOI10.1016/J.JCTA.2006.01.008zbMATH Open1109.05053OpenAlexW2044746336MaRDI QIDQ857413FDOQ857413

Authors: Cai Heng Li, Ákos Seress 

Publication date: 14 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.01.008

Recommendations

• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
• Polygonal graphs
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
• A note on the girth-doubling construction for polygonal graphs
• scientific article; zbMATH DE number 4097435
• A family of near-polygonal graphs of valency 10
• scientific article
• scientific article; zbMATH DE number 653231
• Automorphism groups of covering graphs
• The 7/5‐conjecture strengthens itself

zbMATH Keywords

graph automorphisms2-arc transitive graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The nonexistence of 8-transitive graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized reflection groups. II
• Title not available (Why is that?)

Cited In (7)

• s-Arc-regular prime-valent Cayley graphs of square-free order
• Finite vertex primitive 2-arc regular graphs
• The vertex primitive and vertex bi-primitive \(s\)-arc regular graphs
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
• A family of near-polygonal graphs of valency 10
• The path-cycle symmetric function of a digraph

Uses Software

• GAP

This page was built for publication: Symmetrical path-cycle covers of a graph and polygonal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857413)