Diameter and connectivity of 3-arc graphs

DOI10.1016/j.disc.2009.07.026zbMath1202.05055OpenAlexW2093989139MaRDI QIDQ1045140

Martin Knor, Sanming Zhou

Publication date: 15 December 2009

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

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

zbMATH Keywords

diameterconnectivity3-arc graphsplitting construction3-arc graph construction

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

A study of 3-arc graphs ⋮ Recipes for edge-transitive tetravalent graphs ⋮ Hadwiger's conjecture for 3-arc graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ Hamiltonicity of 3-arc graphs ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Three-arc graphs: characterization and domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Imprimitive symmetric graphs, 3-arc graphs and 1-designs
• Finite symmetric graphs with two-arc transitive quotients
• Constructing a class of symmetric graphs
• A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
• Almost covers of 2-arc transitive graphs
• CROSS RATIO GRAPHS
• Path graphs
• A class of finite symmetric graphs with 2-arc transitive quotients
• Finite symmetric graphs with two‐arc transitive quotients II
• Connectivity of iterated line graphs

This page was built for publication: Diameter and connectivity of 3-arc graphs