RECERCAT Principal
>
Universitat Politècnica de Catalunya
>
Documents de recerca
>
Visualizar documento
Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/10249
| dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III |
|---|---|
| dc.contributor | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| dc.contributor.author | Balbuena Martínez, Maria Camino Teófila |
| dc.contributor.author | García-Vázquez, Pedro |
| dc.date | 2010-10 |
| dc.identifier.citation | 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. |
| dc.identifier.citation | 1439-8516 |
| dc.identifier.citation | 10.1007/s10114-010-9313-y |
| dc.identifier.uri | http://hdl.handle.net/2117/10249 |
| dc.description.abstract | 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 ξ′(D) is the minimum arc-degree of D defined as ξ(D) = min{ξ′(xy): xy ∈ A}, and ξ′(xy) = min{|$ω^+$({x,y})|, |$ω^−$({x,y})|, |$ω^+$(x) ∪ $ω^−$(y)|, |$ω^-$(x)∪$ω^+$(y)|}. In this paper a sufficient condition for a s-geodetic strongly connected digraph D to be λ′-optimal is given in terms of its diameter. Furthermore we see that the h-iterated line digraph $L^h$(D) of a s-geodetic digraph is λ′-optimal for certain iteration h. |
| dc.language.iso | eng |
| dc.rights | info:eu-repo/semantics/openAccess |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| dc.subject | Directed graphs |
| dc.subject | Diameter (Geometry) |
| dc.subject | Graph theory |
| dc.subject | Graph connectivity |
| dc.subject | Finite element method |
| dc.subject | Grafs, Teoria de |
| dc.subject | Elements finits, Mètode dels |
| dc.title | On the restricted arc-connectivity of s-geodetic digraphs |
| dc.type | info:eu-repo/semantics/publishedVersion |
| dc.type | info:eu-repo/semantics/article |
Documentos relacionados
Otros documentos del mismo autor/a
Montejano, Luis P.; Balbuena Martínez, Maria Camino Teófila; García-Vázquez, Pedro
Balbuena Martínez, Maria Camino Teófila; García-Vázquez, Pedro
Abreu, M.; Balbuena Martínez, Maria Camino Teófila; Araujo Pardo, M. Gabriela; Labbate, D.
Balbuena Martínez, Maria Camino Teófila; Fresán Figueroa, J.; González Moreno, Diego; Olsen, Mika
Balbuena Martínez, Maria Camino Teófila; González Moreno, Diego; Olsen, Mika