The minimum number of edges in a vertex diameter-2-critical graph (Q1356444): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00215-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991346464 / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum number of edges in a vertex diameter-2-critical graph |
scientific article |
Statements
The minimum number of edges in a vertex diameter-2-critical graph (English)
0 references
9 November 1997
0 references
A graph \(G\) is called vertex diameter-2-critical if \(\text{diam} (G)=2\) and \(\text{diam} (G-x)>2\) for each vertex \(x\) of the graph. The authors prove that such a graph of order \(n\geq 23\) has at least \((5n-17)/2\) edges. The proof is long and complicated. They also show that this bound is attained for infinitely many graphs.
0 references
vertex diameter-2-critical
0 references
