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

DOI10.1007/s00373-007-0725-0zbMath1122.05052OpenAlexW2063496136MaRDI QIDQ995758

Xiaodong Liang, Zhao Zhang, Ji Xiang 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)

Related Items (7)

LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ Super-connected but not super edge-connected graphs ⋮ On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ On vosperian and superconnected vertex-transitive digraphs ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors

Cites Work

• Unnamed Item
• Unnamed Item
• Super-connected edge transitive graphs
• Vosperian and superconnected abelian Cayley digraphs
• Connectivity of vertex and edge transitive graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Über den Zusammenhang symmetrischer Graphen
• E ₁₁ and M theory
• Circulants and their connectivities
• Synthesis of reliable networks - a survey

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