Title of article
Superconnectivity of graphs with odd girth image and even girth image Original Research Article
Author/Authors
C. Balbuena، نويسنده , , P. Garc?a-V?zquez، نويسنده , , L.P. Montejano، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
9
From page
91
To page
99
Abstract
A maximally connected graph of minimum degree image is said to be superconnected (for short super-image) if all disconnecting sets of cardinality image are the neighborhood of some vertex of degree image. Sufficient conditions on the diameter to guarantee that a graph of odd girth image and even girth image is super-image are stated. Also polarity graphs are shown to be super-image.
Keywords
Polarity graphs , Superconnectivity , Diameter , Girth , Girth pair
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887549
Link To Document