On the superconnectivity in graphs with odd girth g and even girth h

Balbuena Martínez, Maria Camino Teófila; Montejano, Luis P.

doi:10.1016/j.endm.2009.07.089

View/Open

on_superconnectivity_balbuena.pdf (176,5Kb) (Restricted access) Request copy

View Usage Statistics

Cita com:

Show full item record

Balbuena Martínez, Maria Camino Teófila

Montejano, Luis P.

Document typeArticle

Defense date2009-09

Rights accessRestricted access - publisher's policy

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

Abstract

A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the diameter to guarantee that a graph of odd girth g and even girth h ≥ g + 3 is super-κ are stated. Also polarity graphs are shown to be super-κ.

CitationBalbuena, C.; Montejano, L. On the superconnectivity in graphs with odd girth g and even girth h. "Electronic notes in discrete mathematics", Setembre 2009, vol. 34, núm. 1, p. 537-541.

URIhttp://hdl.handle.net/2117/10490

DOI10.1016/j.endm.2009.07.089

ISSN1571-0653

Publisher versionhttp://www.elsevier.com/locate/endm

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
on_superconnectivity_balbuena.pdf		176,5Kb	PDF	Restricted access

UPCommons. Global access to UPC knowledge

On the superconnectivity in graphs with odd girth g and even girth h

View/Open

Browse