| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657242 | Journal of Combinatorial Theory, Series B | 2009 | 16 Pages |
Abstract
For any finite abelian group G and any subset S⊆G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
