A characterization of the non-trivial diameter two graphs of minimum size (Q2348058)
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 6444688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of the non-trivial diameter two graphs of minimum size |
scientific article; zbMATH DE number 6444688 |
Statements
A characterization of the non-trivial diameter two graphs of minimum size (English)
0 references
10 June 2015
0 references
diameter two graphs
0 references
bounds
0 references
size
0 references
0.94864976
0 references
0.92132676
0 references
0.91900855
0 references
0.9151366
0 references
0.9069658
0 references
