Journal
INFORMATION PROCESSING LETTERS
Volume 110, Issue 23, Pages 1027-1030Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2010.09.001
Keywords
Interconnection networks; Cayley graphs; Conditional connectivity; Transposition tree
Categories
Funding
- NSFXJ [2010211A06]
- NSFC [10671165]
Ask authors/readers for more resources
Given a graph G and a non-negative integer h, the R-h-(edge)connectivity of G is the minimum cardinality of a set of (edges)vertices of G, if any, whose deletion disconnects G, and every remaining component has minimum degree at least h. Similarly, given a non-negative integer g, the g-(edge)extraconnectivity of 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 R-2-(edge)connectivity and 2-extra(edge)connectivity of Cayley graphs generated by transposition trees. (C) 2010 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available