Name
Abstract | ||
|---|---|---|
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. In this paper, we show that an n-dimensional Bubble-sort star graph is (2n−5)-fault-tolerant maximally local-connected and is also (2n−6)-fault-tolerant one-to-many maximally local-connected. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2014.10.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Bubble-sort star graph,Maximal local-connectivity,Fault-tolerant | Graph center,Discrete mathematics,Wheel graph,Combinatorics,Hypercube graph,Distance,Cycle graph,Independent set,Degree (graph theory),Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
181 | C | 0166-218X |
Citations | PageRank | References |
3 | 0.40 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongyan Cai | 1 | 3 | 0.40 |
| Huiqing Liu | 2 | 3 | 0.40 |
| Mei Lu | 3 | 151 | 31.01 |