Generalized measures for fault tolerance of star networks

Generalized measures for fault tolerance of star networks

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 Zh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Networks 2014-05, Vol.63 (3), p.225-230
Hauptverfasser: Li, Xiang-Jun, Xu, Jun-Ming
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
combinatorics
Computer science
control theory
systems
Computer systems performance. Reliability
connectivity
Disengaging
Exact sciences and technology
Fault tolerance
Graphs
Information retrieval. Graph
Integers
k-super connectivity
Networks
Software
star networks
Stars
Theoretical computing
Wide area networks
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISSN:0028-3045
1097-0037
DOI:10.1002/net.21539