|
Cyclic Vertex Connectivity of Minimal Circulant Graphs
CHEN Laihuan, MENG Jixiang, LIU Fengxia, TIAN Yingzhi
Acta Mathematicae Applicatae Sinica
2019, 42 (2):
208-219.
DOI: 10.12387/C2019017
A vertex cut F of a graph X is called a cyclic vertex cut if at least two components of X-F contain cycles. The cyclic vertex connectivity of X, denoted by κc(X), is the minimum cardinality of all cyclic vertex cuts. In this paper, we show that, for the minimal circulant graph X=C(Zn,S), (1) if |S|≥2, and 2a≡0(mod n) or 3a≡0(mod n) for some a∈S, or (2) if |S|≥3, and 2a≡0(mod n) and 3a≡0(mod n) for any a∈S, then κc(G)=g(k-2), where g and k(k>2) are the girth and the regularity of X, respectively.
Reference |
Related Articles |
Metrics
|
|