Restricted edge connectivity of a graph G is defined to be the minimum size |U| of a set U of edges such that G-U is disconnected and G-U contains no trivial component K1. The high order edge connectivity Ni, i1, is t...Restricted edge connectivity of a graph G is defined to be the minimum size |U| of a set U of edges such that G-U is disconnected and G-U contains no trivial component K1. The high order edge connectivity Ni, i1, is the number of edge outsets of size i. TO determine all Ni, i 1, for a general graph is NP-hard. In this paper, the authors evaluated the restricted edge connectivity and the high order edge connectivity Ni, 1 i -1, for any connected Abelian Cayley graphs explicitly.展开更多
文摘Restricted edge connectivity of a graph G is defined to be the minimum size |U| of a set U of edges such that G-U is disconnected and G-U contains no trivial component K1. The high order edge connectivity Ni, i1, is the number of edge outsets of size i. TO determine all Ni, i 1, for a general graph is NP-hard. In this paper, the authors evaluated the restricted edge connectivity and the high order edge connectivity Ni, 1 i -1, for any connected Abelian Cayley graphs explicitly.
