Ordering connected graphs having small degree distances (Q602693)
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 5810767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering connected graphs having small degree distances |
scientific article; zbMATH DE number 5810767 |
Statements
Ordering connected graphs having small degree distances (English)
0 references
5 November 2010
0 references
degree distance
0 references
eccentricity
0 references
diameter
0 references
tree
0 references
bistar
0 references
0.9725871
0 references
0.90718067
0 references
0.9065349
0 references
0.89472854
0 references
0.88635373
0 references
0.8841858
0 references
0.88199306
0 references
0.8811253
0 references
0 references
