Mostra el registre d'ítem simple
On the restricted connectivity and superconnectivity in graphs with given girth
dc.contributor.author | Balbuena Martínez, Maria Camino Teófila |
dc.contributor.author | Cera, M |
dc.contributor.author | Diánez, A |
dc.contributor.author | García-Vázquez, P |
dc.contributor.author | Marcote Ordax, Francisco Javier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III |
dc.date.accessioned | 2013-04-22T11:28:54Z |
dc.date.created | 2007-03 |
dc.date.issued | 2007-03 |
dc.identifier.citation | Balbuena, M. [et al.]. On the restricted connectivity and superconnectivity in graphs with given girth. "Discrete mathematics", Març 2007, vol. 307, núm. 6, p. 659-667. |
dc.identifier.issn | 0012-365X |
dc.identifier.uri | http://hdl.handle.net/2117/18915 |
dc.description | "Discrete Mathemetics Top Cited Article 2005-2010" |
dc.description.abstract | The restricted connectivity κ′(G)κ′(G) of a connected graph G is defined as the minimum cardinality of a vertex-cut over all vertex-cuts X such that no vertex uu has all its neighbors in X; the superconnectivity κ1(G)κ1(G) is defined similarly, this time considering only vertices uu in G-XG-X, hence κ1(G)⩽κ′(G)κ1(G)⩽κ′(G). The minimum edge-degree of G is ξ(G)=min{d(u)+d(v)-2:uv∈E(G)}ξ(G)=min{d(u)+d(v)-2:uv∈E(G)}, d(u)d(u) standing for the degree of a vertex uu. In this paper, several sufficient conditions yielding κ1(G)⩾ξ(G)κ1(G)⩾ξ(G) are given, improving a previous related result by Fiol et al. [Short paths and connectivity in graphs and digraphs, Ars Combin. 29B (1990) 17–31] and guaranteeing κ1(G)=κ′(G)=ξ(G)κ1(G)=κ′(G)=ξ(G) under some additional constraints. |
dc.format.extent | 9 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
dc.subject.lcsh | Superconnectivity |
dc.subject.lcsh | Restricted connectivity |
dc.title | On the restricted connectivity and superconnectivity in graphs with given girth |
dc.type | Article |
dc.subject.lemac | Connectivitat |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1016/j.disc.2006.07.016 |
dc.description.peerreviewed | Peer Reviewed |
dc.description.awardwinning | Award-winning |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0012365X06006017 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 643091 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Balbuena, M.; Cera, M.; Diánez, A.; García-Vázquez, P.; Marcote, F. |
local.citation.publicationName | Discrete mathematics |
local.citation.volume | 307 |
local.citation.number | 6 |
local.citation.startingPage | 659 |
local.citation.endingPage | 667 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.265]
-
Articles de revista [290]