The Connectivity of addition Cayley graphs
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. © 2007 Elsevier B.V. All rights reserved.
Publication Title
Electronic Notes in Discrete Mathematics
Recommended Citation
Grynkiewicz, D., Lev, V., & Serra, O. (2007). The Connectivity of addition Cayley graphs. Electronic Notes in Discrete Mathematics, 29 (SPEC. ISS.), 135-139. https://doi.org/10.1016/j.endm.2007.07.031
COinS
