Article ID Journal Published Year Pages File Type
4650159 Discrete Mathematics 2009 9 Pages PDF
Abstract

A graph GG is said to be semi-hyper-connected if the removal of every minimum cut of GG creates exactly two connected components. In this paper, we characterize semi-hyper-connected vertex transitive graphs, in particular Cayley graphs.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Semi-hyper-connected vertex transitive graphs
Authors
,