Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/921623
- On the connectivity and superconnected graphs with small diameter
Montejano, L. P.
- The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
- 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 Δ≤2δ−1 where δ is the minimum degree. Moreover, we prove that any graph G of diameter diam(G)≤g−2 satisfies that (i) G is 5-connected for even girth g and Δ≤2δ−5, and (ii) G is super-κ for odd girth g and Δ≤3δ/2−1.
- Discrete Applied Mathematics Vol. 158, Issue 5, p. 397-403
- Publisher Link
- Resource Type
- journal article