Unicyclic connected graphs having smallest degree distances (Q2811701)
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 6592304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unicyclic connected graphs having smallest degree distances |
scientific article; zbMATH DE number 6592304 |
Statements
10 June 2016
0 references
Unicyclic connected graphs having smallest degree distances (English)
0 references
0.9025928974151612
0 references
0.8853001594543457
0 references
0.8738867044448853
0 references
0.8484365344047546
0 references
0.8401737809181213
0 references
