No label defined (Q3758864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4008431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4008431 |
Statements
1984
0 references
diameter 2
0 references
maximal degree k
0 references
0 references
0.9250188
0 references
0.92457616
0 references
0.9226663
0 references
0.91694057
0 references
0.9146416
0 references
Denote \(H_ 2(n,k)\) the set of all undirected graphs of order \(n\), diameter 2 and maximal degree \(k\). Let \(e(G)\) mean the number of edges of the graph \(G\), and \(F_ 2(n,k)=\min_{G\in H_ 2(n,k)}e(G)\). The author proves the following theorem: Let a positive \(h<1/14\) be given. If \(n>21/h^ 2\), \(3n/7\leq k<(1/2-h)n\), then \(F_ 2(n,k)=3n-12\).
0 references