\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)

DOI10.1016/j.ipl.2009.03.001zbMath1209.68384OpenAlexW1579475208MaRDI QIDQ989453

Yingzhi Tian, Ji Xiang Meng

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.001

zbMATH Keywords

combinatorial problemscyclic edge connectivitybi-Cayley graphs\(\lambda _c\)-optimalhalf vertex transitive graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On computing of a conditional edge connectivity of alternating group network ⋮ On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ Atoms of cyclic edge connectivity in regular graphs

Cites Work

• On conditional edge-connectivity of graphs
• Optimally super-edge-connected transitive graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Conditional connectivity
• Connectivity of transitive graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)