dc.contributor.author Balbuena Martínez, Maria Camino Teófila dc.contributor.author García-Vázquez, Pedro dc.contributor.other Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III dc.date.accessioned 2010-11-11T11:07:02Z dc.date.available 2010-11-11T11:07:02Z dc.date.created 2010-10 dc.date.issued 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.issn 1439-8516 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.format.extent 12 p. dc.language.iso eng dc.subject Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs dc.subject.lcsh Directed graphs dc.subject.lcsh Diameter (Geometry) dc.subject.lcsh Graph theory dc.subject.lcsh Graph connectivity dc.subject.lcsh Finite element method dc.title On the restricted arc-connectivity of s-geodetic digraphs dc.type Article dc.subject.lemac Grafs, Teoria de dc.subject.lemac Elements finits, Mètode dels dc.contributor.group Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions dc.identifier.doi 10.1007/s10114-010-9313-y dc.rights.access Restricted access - publisher's policy local.identifier.drac 3272141 dc.description.version Postprint (published version) local.citation.author Balbuena, C.; García-Vázquez, P. local.citation.publicationName Acta mathematica sinica. English series local.citation.volume 26 local.citation.number 10 local.citation.startingPage 1865 local.citation.endingPage 1876
﻿

### This item appears in the following Collection(s)

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder