Super restricted edge-connectivity of vertex-transitive graphs

DOI10.1016/j.disc.2004.08.011zbMath1056.05092OpenAlexW1999819315MaRDI QIDQ1763355

Ying Qian Wang

Publication date: 22 February 2005

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

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

zbMATH Keywords

Restricted edge-connectivityVertex-transitive graphs

Mathematics Subject Classification ID

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

Related Items

Structure connectivity and substructure connectivity of hypercubes ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ A new approach to finding the extra connectivity of graphs ⋮ On restricted edge-connectivity of vertex-transitive multigraphs ⋮ On super restricted edge connectivity of half vertex transitive graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Super-connected but not super edge-connected graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ Edge-connectivity of regular graphs with two orbits ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ On super restricted edge-connectivity of edge-transitive graphs ⋮ On the edge-connectivity of graphs with two orbits of the same size ⋮ Super restricted edge connected Cartesian product graphs ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Super edge-connectivity of mixed Cayley graph ⋮ 3-Factor-Criticality of Vertex-Transitive Graphs ⋮ Sufficient conditions for triangle-free graphs to be super-$λ'$ ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ On the existence of edge cuts leaving several large components ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Super connectivity of line graphs ⋮ On the conditional edge connectivity of double-orbit graphs

Cites Work

• On computing a conditional edge-connectivity of a graph
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Conditional connectivity
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item