Can I read Diameter-sufficient Conditions for a Graph to Be Super-restricted Connected on EtoBox?

Diameter-sufficient Conditions for a Graph to Be Super-restricted Connected by Camino Balbuena; Yuqing Lin; Mirka Miller is a Computer Science article available to read on EtoBox.

What is Diameter-sufficient Conditions for a Graph to Be Super-restricted Connected about?

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-restrictedconnected graphs are given in terms of the girth and the diameter. The corresponding problem for super-edge-restricted-connected graph is also studied.

Who reads Diameter-sufficient Conditions for a Graph to Be Super-restricted Connected?

Author

Camino Balbuena; Yuqing Lin; Mirka Miller

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

2008

Language

EN

Field

Computer Science (Physical Sciences)