Name
Abstract | ||
|---|---|---|
Let G be a graph of order n(G), minimum degree δ(G) and connectivity κ(G). We call the graph G maximally connected when κ(G)=δ(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.dam.2011.11.016 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Connectivity,Superconnected,Vertex transitive graphs,Diamond-free graphs,p-diamond-free graphs | Discrete mathematics,Circulant graph,Combinatorics,Vertex-transitive graph,Loop (graph theory),Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Regular graph,Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
160 | 7 | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingzhi Tian | 1 | 20 | 9.28 |
| Jixiang Meng | 2 | 353 | 55.62 |
| Zhao Zhang | 3 | 706 | 102.46 |