Superconnectivity of graphs with odd girth g and even girth h

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/7902

Title:	Superconnectivity of graphs with odd girth g and even girth h
Author:	Montejano, Luis P.; Balbuena Martínez, Maria Camino Teófila; García-Vázquez, Pedro
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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-κ.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Polarity -Graph theory -Diameter (Geometry) -Graph connectivity -Polarització (Electricitat) -Grafs, Teoria de
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Conference Object
Share: