A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs
Keyword(s):
Abstract Let $G=(V(G), E(G))$ be a connected graph. A subset $T \subseteq V(G)$ is called an $R^{k}$-vertex-cut, if $G-T$ is disconnected and each vertex in $V(G)-T$ has at least $k$ neighbors in $G-T$. The cardinality of a minimum $R^{k}$-vertex-cut is the $R^{k}$-vertex-connectivity of $G$ and is denoted by $\kappa ^{k}(G)$. $R^{k}$-vertex-connectivity is a new measure to study the fault tolerance of network structures beyond connectivity. In this paper, we study $R^{1}$-vertex-connectivity and $R^{2}$-vertex-connectivity of Cayley graphs generated by wheel graphs, which are denoted by $AW_{n}$, and show that $\kappa ^{1}(AW_{n})=4n-7$ for $n\geq 6$; $\kappa ^{2}(AW_{n})=6n-12$ for $n\geq 6$.
2017 ◽
Vol 32
◽
pp. 438-446
◽
2011 ◽
Vol 181
(19)
◽
pp. 4300-4308
◽
2017 ◽
Vol 301
◽
pp. 177-186
◽
2015 ◽
Vol 15
(01n02)
◽
pp. 1550007
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 30
(08)
◽
pp. 1301-1315
◽
2014 ◽
Vol 93
(1)
◽
pp. 67-82
◽