Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs

DOI10.1007/S00373-007-0725-0MaRDI QIDQ995758zbMATH OpenOpenAlexFDO

Authors Xiaodong Liang, Zhao Zhang, Jixiang Meng

Publication date 10 September 2007

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

Full work available at URL https://doi.org/10.1007/s00373-007-0725-0

zbMATH Keywords

Bipartite Cayley graphVertex transitive bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Connectivity of vertex and edge transitive graphs
• Superconnected and hyperconnected small degree transitive graphs
• scientific article; zbMATH DE number 5670535
• Super-connected edge transitive graphs
• On super restricted edge connectivity of half vertex transitive graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 857069 (Why is no real title available?)
• Circulants and their connectivities
• Connectivity of vertex and edge transitive graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Super-connected edge transitive graphs
• Synthesis of reliable networks - a survey
• Vosperian and superconnected abelian Cayley digraphs
• \(E_{11}\) and M theory
• Über den Zusammenhang symmetrischer Graphen

Cited in

(16)

• Super-pancyclic hypergraphs and bipartite graphs
• Connectivity of vertex and edge transitive graphs
• Linearly many faults in \((n,k)\)-star graphs
• On the connectivity of \(p\)-diamond-free vertex transitive graphs
• The super-connectivity of Kneser graphs
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• Vulnerability of super connected split graphs and bisplit graphs
• scientific article; zbMATH DE number 5670535 (Why is no real title available?)
• scientific article; zbMATH DE number 5671145 (Why is no real title available?)
• Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
• Super-connected but not super edge-connected graphs
• On vosperian and superconnected vertex-transitive digraphs
• Superconnected and hyperconnected small degree transitive graphs
• Semi-hyper-connected vertex transitive graphs
• Super-connected and hyper-connected jump graphs

This page was built for publication: Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995758)