Name
Abstract | ||
|---|---|---|
The edge connectivity is a kind of classic measure of fault tolerance of networks. It is well known that the edge-connectivity of a simple, connected, vertex transitive graph attains its regular degree. It is then natural to consider the relationship between the edge connectivity and the number of orbits of its automorphism group. The double-orbit graphs with two orbits of the same size is a generalization of vertex transitive networks, which contains several classic network models. In this note, we obtain a sufficient condition for such double-orbit graphs to be super-λ′. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.future.2017.09.008 | Future Generation Computer Systems |
Keywords | Field | DocType |
Graphs and networks,Edge-connectivity,Orbit,Super-edge-connected,Transitive graph | Combinatorics,Transitive reduction,Loop (graph theory),Computer science,Edge cover,Neighbourhood (graph theory),Edge contraction,Algebraic connectivity,Independent set,Symmetric graph,Distributed computing | Journal |
Volume | ISSN | Citations |
83 | 0167-739X | 1 |
PageRank | References | Authors |
0.35 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huiqiu Lin | 1 | 34 | 11.56 |
| Weihua Yang | 2 | 44 | 7.69 |