On super restricted edge connectivity of half vertex transitive graphs

DOI10.1007/S00373-011-1035-0zbMath1256.05104OpenAlexW1996906085MaRDI QIDQ1926063

Yingzhi Tian, Xiaodong Liang, Ji Xiang Meng

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1035-0

zbMATH Keywords

bipartite graphautomorphism groupcomponentrestricted edge connectivitysuperatomsbi-Cayley graphsminimum edge setconnected half vertex transitive graphsminimum edge degreesuper restricted edge connectedsuper restricted edge connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (3)

A characterization of graphs by codes from their incidence matrices ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ On the conditional edge connectivity of double-orbit graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing a conditional edge-connectivity of a graph
• On a kind of restricted edge connectivity of graphs
• Super restricted edge-connectivity of vertex-transitive graphs
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Optimally super-edge-connected transitive graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Conditional connectivity
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Complexity of network reliability computations
• On restricted edge-connectivity of graphs.

This page was built for publication: On super restricted edge connectivity of half vertex transitive graphs