Superconnectivity of regular graphs with small diameter | NOVA. The University of Newcastle's Digital Repository

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/916580

Title: Superconnectivity of regular graphs with small diameter
Author/Creator: Balbuena, Camino; Tang, Jianmin; Marshall, Kim; Lin, Yuqing
Institution: The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
Description: 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.
Relation: Discrete Applied Mathematics Vol. 157, Issue 7, p. 1349-1353
Publisher Link: http://dx.doi.org/10.1016/j.dam.2008.11.002
Date: 2009
Publisher: Elsevier
Keyword(s): connectivity; superconnectivity; cutset; diameter; girth
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/916580
Identifier: ISSN:0166-218X

5 Visitors

8 Hits

NOVA. The University of Newcastle's Digital Repository