Premium
Generalized measures for fault tolerance of star networks
Author(s) -
Li XiangJun,
Xu JunMing
Publication year - 2014
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21539
Subject(s) - conjecture , star (game theory) , combinatorics , fault tolerance , mathematics , zhàng , degree (music) , graph , discrete mathematics , computer science , physics , distributed computing , mathematical analysis , law , political science , acoustics , china
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 © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 225–230 2014