Superconnectivity of graphs with odd girth g and even girth h

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

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	Montejano, Luis P.
dc.contributor.author	Balbuena Martínez, Maria Camino Teófila
dc.contributor.author	García-Vázquez, Pedro
dc.date	2009-09
dc.identifier.citation	Montejano, L.; Balbuena, C.; García-Vázquez, P. Superconnectivity of graphs with odd girth g and even girth h. A: Eurocomb 2009: European conference on combinatorics, Graph Theory and Applications. "Eurocomb 2009: European conference on combinatorics, Graph Theory and Applications". 2009.
dc.identifier.uri	http://hdl.handle.net/2117/7902
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75GV-4WWHRTR-36-1&_cdi=13104&_user=1517299&_pii=S1571065309001310&_orig=search&_coverDate=08%2F01%2F2009&_sk=999659999&view=c&wchp=dGLbVtz-zSkWb&md5=edefd7e5ebf011cfce2e7fc842cc4575&ie=/sdarticle.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Polarity
dc.subject	Graph theory
dc.subject	Diameter (Geometry)
dc.subject	Graph connectivity
dc.subject	Polarització (Electricitat)
dc.subject	Grafs, Teoria de
dc.title	Superconnectivity of graphs with odd girth g and even girth h
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.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-κ.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author