Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors

Autor
Hamidoune, Y.O.; Llado, A.; López, S.C.
Tipus d'activitat
Article en revista
Revista
Journal of graph theory
Data de publicació
2011-06
Volum
67
Número
2
Pàgina inicial
124
Pàgina final
138
DOI
https://doi.org/10.1002/jgt.20521 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/12985 Obrir en finestra nova
URL
http://onlinelibrary.wiley.com/doi/10.1002/jgt.20521/pdf Obrir en finestra nova
Resum
A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex and its neighbors will be called vosperian. Let Γ be a vertex-transitive graph of degree d with order at least d+4. We give necessary and sufficient conditions for the vosperianity of Γ. Moreover, assuming that distinct vertices have distinct neighbors, we show that Γ is vosp...
Citació
Hamidoune, Y.O.; Llado, A.; López, S.C. Vertex-Transitive Graphs That Remain Connected After Failure of a Vertex and Its Neighbors. "Journal of graph theory", Juny 2011, vol. 67, núm. 2, p. 124-138.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants