|
|
| |
| REFINED CONNECTIVITY PROPERTIES OF ABELIAN CAYLEY GRAPHS |
| |
Citation： |
Li Qiaoliang,Li Qiao.REFINED CONNECTIVITY PROPERTIES OF ABELIAN CAYLEY GRAPHS[J].Chinese Annals of Mathematics B,1998,19(4):409~414 |
| Page view： 1109
Net amount： 871 |
Authors： |
Li Qiaoliang; Li Qiao |
Foundation： |
the National Natural Science Foundation of China (No. 19671057) |
|
|
| Abstract： |
Restricted edge connectivity $ \lambda^{'} $ 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 $ K_1 $. The high order edge connectivity $ N_i, $ $ i\geq 1, $ is the number of edge cutsets of size $ i. $ To determine all $ N_i, $ $ i\geq 1, $ for a general graph is $NP$-hard. In this paper, the authors evaluated the restricted edge connectivity $\lambda^{'} $ and the high order edge connectivity $ N_i, $ $ 1\leq i\leq \lambda^{'}-1, $ for any connected Abelian Cayley graphs explicitly. |
Keywords： |
Abelian Cayley graph, Restricted edge connectivity, High order
edge connectivity |
Classification： |
O5C40, O5C25 |
|
|
Download PDF Full-Text
|
|
|
|
