3-extraconnectivity of Cayley Graphs Generated by Transposition Generating Trees
Yang Wei-hua · Shinjang dashösi ilmiy jurnili · 2011
Given a graph G and a non-negative integer g, the g-extra(edge) connectivity of G (written κg(G)(λg(G))is the minimum cardinality of a set of (edges)vertices of G, if any, whose deletion disconnects G, and every remaining component has more than g vertices. In this paper, we determine 3-extra(edge) connectivity(written κ3(λ3)) of Cayley graphs generated by transposition trees.