Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
From MaRDI portal
Publication:995758
DOI10.1007/S00373-007-0725-0zbMATH Open1122.05052OpenAlexW2063496136MaRDI QIDQ995758FDOQ995758
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
Recommendations
Cites Work
- Title not available (Why is that?)
- \(E_{11}\) and M theory
- Connectivity of vertex and edge transitive graphs
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Über den Zusammenhang symmetrischer Graphen
- Title not available (Why is that?)
- Vosperian and superconnected abelian Cayley digraphs
- Super-connected edge transitive graphs
Cited In (14)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Super-pancyclic hypergraphs and bipartite graphs
- Semi-hyper-connected vertex transitive graphs
- Title not available (Why is that?)
- On the connectivity of \(p\)-diamond-free vertex transitive graphs
- Superconnected and hyperconnected small degree transitive graphs
- Connectivity of vertex and edge transitive graphs
- Title not available (Why is that?)
- Super-connected but not super edge-connected graphs
- On vosperian and superconnected vertex-transitive digraphs
- Super-connected and hyper-connected jump graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
- Linearly many faults in \((n,k)\)-star 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)
