Now showing items 1-3 of 3

• #### On the connectivity and superconnected graphs with small diameter ﻿

(2010-03-06)
Article
Restricted access - publisher's policy
In this paper, first we prove that any graph G is 2-connected if diam (G)≤ g-1 for even girth g, and for odd girth g and maximum degree $\Delta$ ≤ 2$\delta$-1 where $\delta$ is the minimum degree. Moreover, we prove that ...
• #### On the superconnectivity in graphs with odd girth g and even girth h ﻿

(2009-09)
Article
Restricted 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 ...
• #### Superconnectivity of graphs with odd girth g and even girth h ﻿

(2009-09)
Conference report
Restricted 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 ...