Name
Abstract | ||
|---|---|---|
We study the k -diameter of k -regular k -connected graphs. Among other results, we show that every k -regular k -connected graph on n vertices has k -diameter at most n /2 and this upper bound cannot be improved when n =4 k −6+ i (2 k −4). In particular, the maximal 3-diameter of 3-regular graphs with 2 n vertices is equal to n . |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0012-365X(94)90036-1 | Discrete Mathematics |
Keywords | Field | DocType |
k-regular k-connected graph,connected graph | Random regular graph,Discrete mathematics,Combinatorics,Graph toughness,Strongly regular graph,k-vertex-connected graph,Chordal graph,Clique-sum,Distance-regular graph,Pancyclic graph,Mathematics | Journal |
Volume | Issue | ISSN |
133 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
18 | 1.42 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Frank Hsu | 1 | 722 | 66.32 |
| Tomasz Łuczak | 2 | 225 | 40.26 |