7 research outputs found
Linearly many faults in 2-tree-generated networks
In this article we consider a class of Cayley graphs that are generated by certain 3-cycles on the alternating group A n . These graphs are generalizations of the alternating group graph A G n . We look at the case when the 3-cycles form a βtree-like structure,β and analyze its fault resiliency. We present a number of structural theorems and prove that even with linearly many vertices deleted, the remaining graph has a large connected component containing almost all vertices. Β© 2009 Wiley Periodicals, Inc. NETWORKS, 2010Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/64908/1/20319_ftp.pd
Fault-tolerant analysis of augmented cubes
The augmented cube , proposed by Choudum and Sunitha [S. A. Choudum, V.
Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a -regular
-connected graph . This paper determines that the 2-extra
connectivity of is for and the 2-extra
edge-connectivity is for . That is, for
(respectively, ), at least vertices (respectively,
edges) of have to be removed to get a disconnected graph that contains
no isolated vertices and isolated edges. When the augmented cube is used to
model the topological structure of a large-scale parallel processing system,
these results can provide more accurate measurements for reliability and fault
tolerance of the system
Fault diagnosability of regular graphs
An interconnection network\u27s diagnosability is an important measure of its self-diagnostic capability. In 2012, Peng et al. proposed a measure for fault diagnosis of the network, namely, the -good-neighbor conditional diagnosability, which requires that every fault-free node has at least fault-free neighbors. There are two well-known diagnostic models, PMC model and MM* model. The {\it -good-neighbor diagnosability} under the PMC (resp. MM*) model of a graph , denoted by (resp. ), is the maximum value of such that is -good-neighbor -diagnosable under the PMC (resp. MM*) model. In this paper, we study the -good-neighbor diagnosability of some general -regular -connected graphs under the PMC model and the MM* model. The main result with some acceptable conditions is obtained, where is the girth of . Furthermore, the following new results under the two models are obtained: for the hierarchical star network , for the split-star networks and for the Cayley graph generated by the -tree