Journal
NETWORKS
Volume 63, Issue 3, Pages 225-230Publisher
WILEY-BLACKWELL
DOI: 10.1002/net.21539
Keywords
connectivity; fault-tolerance; combinatorics; star networks; k-super connectivity
Funding
- NNSF of China [61272008]
Ask authors/readers for more resources
This article shows that, for any integers n and k with 0 <= k <= n-2, at least (k+1)!(n-k-1) vertices or edges have to be removed from an n-dimensional star graph to make it disconnected with no vertices of degree less than k. The result gives an affirmative answer to the conjecture proposed by Wan and Zhang (Appl Math Lett 22 (2009), 264-267).Copyright (c) 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 225-230 2014
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
Share Paper
