Title of article
Semi-hyper-connected vertex transitive graphs
Author/Authors
Zhang، نويسنده , , Zhao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
9
From page
899
To page
907
Abstract
A graph G is said to be semi-hyper-connected if the removal of every minimum cut of G creates exactly two connected components. In this paper, we characterize semi-hyper-connected vertex transitive graphs, in particular Cayley graphs.
Keywords
Semi-hyper-connected , Vertex transitive , Cayley graph
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598550
Link To Document