Diameter-sufficient conditions for a graph to be super-restricted connected

Title: Diameter-sufficient conditions for a graph to be super-restricted connected
Creator: Balbuena, Camino; Lin, Yuqing; Miller, Mirka
Relation: Discrete Applied Mathematics Vol. 156, Issue 15, p. 2827-2834
Publisher Link: http://dx.doi.org/10.1016/j.dam.2007.11.015
Publisher: Elsevier
Resource Type: journal article
Date: 2008
Description: A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G−X must have at least two vertices. The restricted connectivity κ'(G) of a connected graph G is defined as the minimum cardinality of a restricted cut. Additionally, if the deletion of a minimum restricted cut isolates one edge, then the graph is said to be super-restricted connected. In this paper, several sufficient conditions yielding super-restricted connected graphs are given in terms of the girth and the diameter. The corresponding problem for super-edge-restricted-connected graph is also studied.
Subject: diameter; girth; restricted connectivity
Identifier: http://hdl.handle.net/1959.13/41442
Identifier: uon:4799
Identifier: ISSN:0166-218X
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format