Super-cyclically edge-connected regular graphs

DOI10.1007/s10878-012-9472-0zbMath1298.90123OpenAlexW2074170810MaRDI QIDQ2392737

Jin-Xin Zhou, Yan Quan Feng

Publication date: 2 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9472-0

zbMATH Keywords

edge-transitivecyclic edge-connectivitycyclic edge-cutsuper cyclically edge-connected

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Edge-transitive bi-Cayley graphs ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ On the reliability of modified bubble-sort graphs ⋮ Some results about the reliability of folded hypercubes

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Super cyclically edge connected transitive graphs
• Infinitely many hypohamiltonian cubic graphs of girth 7
• On super restricted edge-connectivity of edge-transitive graphs
• Tetravalent edge-transitive graphs of girth at most 4
• Cubic symmetric graphs of order a small number times a prime or a prime square
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of transitive graphs
• On weakly symmetric graphs of order twice a prime
• On computing a conditional edge-connectivity of a graph
• On the 2-extendability of planar graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• The Magma algebra system. I: The user language
• A census of semisymmetric cubic graphs on up to 768 vertices
• Some Historical and Intuitive Aspects of Graph Theory
• Circulants and their connectivities
• Transitive Graphs With Fewer Than Twenty Vertices

This page was built for publication: Super-cyclically edge-connected regular graphs