| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 394642 | Information Sciences | 2011 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Eddie Cheng, László Lipták, Weihua Yang, Zhao Zhang, Xiaofeng Guo,