A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Let G be a graph. Then T?V(G) is called an Rk-vertex-cut if G?T is disconnected and each vertex in V(G)?T has at least k neighbors in G?T. The size of a smallest Rk-vertex-cut is the Rk-vertex-connectivity of G and is denoted by ?k(G). In this paper, we determine the numbers ?1 and ?2 for Cayley graphs generated by 2-trees, including the popular alternating group graphs.
conditional vertex connectivity cayley graphs