An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph (Q827214): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2020/8367408 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3047015237 / rank | |||
Normal rank | |||
Revision as of 21:00, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph |
scientific article |
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
