Rights accessRestricted access - publisher's policy
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.
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. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org