Name
Abstract | ||
|---|---|---|
This paper considers a kind of generalized measure @l"s^(^h^) of fault tolerance in a hypercube-like graph G"n which contains several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes, crossed cubes, Mobius cubes and the recursive circulant G(2^n,4), and proves @l"s^(^h^)(G"n)=2^h(n-h) for any h with 0@?h@?n-1 by the induction on n and a new technique. This result shows that at least 2^h(n-h) edges of G"n have to be removed to get a disconnected graph that contains no vertices of degree less than h. Compared with previous results, this result enhances fault-tolerant ability of the above-mentioned networks theoretically. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ipl.2013.07.010 | Inf. Process. Lett. |
Keywords | Field | DocType |
generalized measure,above-mentioned networks theoretically,varietal hypercubes,fault-tolerant ability,mobius cube,hypercube-like graph,disconnected graph,previous result,hypercube-like network,fault tolerance,edge-fault tolerance,new technique,connectivity,networks,combinatorics | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Fault tolerance,Circulant matrix,Interconnection,Recursion,Mathematics,Hypercube,Cube | Journal |
Volume | Issue | ISSN |
113 | 19-21 | 0020-0190 |
Citations | PageRank | References |
6 | 0.43 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang-Jun Li | 1 | 51 | 4.37 |
| Jun-ming Xu | 2 | 671 | 53.22 |