Name
Abstract | ||
|---|---|---|
Let G be any 3-connected graph containing n vertices and r the radius of G. Then the inequality r < 14n + O(log n) is proved. A similar theorem concerning any (2m −1)-connected graph G can be proved too. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0095-8956(81)90101-5 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Discrete mathematics,Random regular graph,Combinatorics,Strongly regular graph,Graph toughness,Graph power,k-vertex-connected graph,Bound graph,Distance-regular graph,Graph minor,Mathematics | Journal | 30 |
Issue | ISSN | Citations |
1 | 0095-8956 | 4 |
PageRank | References | Authors |
1.02 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jochen Harant | 1 | 217 | 30.62 |
| Hansjoachim Walther | 2 | 97 | 20.10 |