Condicions d'accésAccés restringit per política de l'editorial
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-κ.
Citació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.