Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/916580
- Superconnectivity of regular graphs with small diameter
- The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
- A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D≤g−2, then the graph is super-κ when g≥5 and a complete graph otherwise.
- Discrete Applied Mathematics Vol. 157, Issue 7, p. 1349-1353
- Publisher Link
- Resource Type
- journal article