Name
Abstract | ||
|---|---|---|
We give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a connected graph, (ii) a connected trangle-free graph, (iii) a connected C4-free graph with n vertices and with minimum degree δ, where n tends to infinity. Some conjectures for Kr-free graphs are also stated. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0095-8956(89)90066-X | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
diameter,radius | Graph theory,Strength of a graph,Discrete mathematics,Combinatorics,k-vertex-connected graph,k-edge-connected graph,Degree (graph theory),Distance-regular graph,Connectivity,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
47 | 1 | 0095-8956 |
Citations | PageRank | References |
38 | 4.49 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| János Pach | 2 | 2366 | 292.28 |
| Richard Pollack | 3 | 38 | 4.49 |
| Zsolt Tuza | 4 | 1889 | 262.52 |