Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the restricted arc-connectivity of s-geodetic digraphs

Autor
Balbuena, C.; García, P.
Tipus d'activitat
Article en revista
Revista
Acta mathematica sinica, english series
Data de publicació
2010-10
Volum
26
Número
10
Pàgina inicial
1865
Pàgina final
1876
DOI
https://doi.org/10.1007/s10114-010-9313-y Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/10249 Obrir en finestra nova
Resum
For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum cardinality of an arc-cut over all arc-cuts S satisfying that D - S has a non-trivial strong component D₁ such that D-V (D₁) contains an arc. Let S be a subset of vertices of D. We denote by $ω^+$(S) the set of arcs uv with u ∈ S and v ∉ S, and by $ω^−$(S) the set of arcs uv with u ∉ S and v ∈ S. A digraph D = (V,A) is said to be λ′-optimal if λ′(D) = ξ′(D), where ξ′(...
Citació
Balbuena, C.; García-Vázquez, P. On the restricted arc-connectivity of s-geodetic digraphs. "Acta mathematica sinica. English series", Octubre 2010, vol. 26, núm. 10, p. 1865-1876.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants