An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph (Q827214)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph |
scientific article; zbMATH DE number 7290905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph |
scientific article; zbMATH DE number 7290905 |
Statements
An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph (English)
0 references
7 January 2021
0 references
Summary: We show that if \(G\) is a 3-vertex-connected \(C_4\)-free graph of order \(n\) and radius \(r\), then the inequality \(r\leq(2n/9)+O(1)\) holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
0 references
