An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph
We show that if G is a 3-vertex-connected C4-free graph of order n and radius r, then the inequality r≤2n/9+O1 holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2020/8367408 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|