| Article ID: | iaor201522237 |
| Volume: | 63 |
| Issue: | 3 |
| Start Page Number: | 225 |
| End Page Number: | 230 |
| Publication Date: | May 2014 |
| Journal: | Networks |
| Authors: | Li Xiang-Jun, Xu Jun-Ming |
| Keywords: | graphs |
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).Copyrigh.