Abstract
Let G be a 3-edge-connected graph of order n and radius rad(G). Then the inequality rad(G) ≤ 1/3n + 17/3 is proved. Moreover, graphs are constructed to show that the bound is asymptotically sharp.
| Original language | English |
|---|---|
| Pages (from-to) | 207-215 |
| Number of pages | 9 |
| Journal | Utilitas Mathematica |
| Volume | 73 |
| Publication status | Published - 2007 |
| Externally published | Yes |
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics