Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
From MaRDI portal
Publication:3005114
DOI10.1002/jgt.20521zbMath1217.05121OpenAlexW2089313123MaRDI QIDQ3005114
Anna S. Lladó, Susana-Clara López, Yahya Ould Hamidoune
Publication date: 7 June 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/66511
Related Items (6)
On vosperian and superconnected vertex-transitive digraphs ⋮ Small cutsets in arc-transitive digraphs of prime degree ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ Cayley digraphs and graphs ⋮ A structure theorem for small sumsets in nonabelian groups ⋮ The toughness of Kneser graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diameter, short paths and superconnectivity in digraphs
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Some additive applications of the isoperimetric approach
- On the connectivity and superconnected graphs with small diameter
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Super-connected arc-transitive digraphs
- Vosperian and superconnected abelian Cayley digraphs
- Superconnectivity of bipartite digraphs and graphs
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- The superconnectivity of large digraphs and graphs
- Extraconnectivity of graphs with large girth
- Extraconnectivity of graphs with large minimum degree and girth
- Subsets with small sums in abelian groups. I: The Vosper property
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- Connectivity of vertex and edge transitive graphs
- An isoperimetric method in additive theory
- On the extraconnectivity of graphs
- On the connectivity of Cayley digraphs
- Vertex-transitive graphs
- Über den Zusammenhang symmetrischer Graphen
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Some results in additive number theory I: The critical pair theory
- On Isoperimetric Connectivity in Vertex-Transitive Graphs
- Connectivity of transitive graphs
- Eine Eigenschaft der Atome endlicher Graphen
This page was built for publication: Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
