On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On acyclic and unicyclic graphs whose minimum rank equals the diameter |
scientific article; zbMATH DE number 5349132
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On acyclic and unicyclic graphs whose minimum rank equals the diameter |
scientific article; zbMATH DE number 5349132 |
Statements
On acyclic and unicyclic graphs whose minimum rank equals the diameter (English)
0 references
6 October 2008
0 references
minimum rank
0 references
path cover
0 references
diameter
0 references
maximum multiplicity
0 references
acyclic graph
0 references
unicyclic graph
0 references
0 references
0.9191096
0 references
0.9140162
0 references
0.90127575
0 references
0.9012197
0 references
0.8991142
0 references
0.8973853
0 references
0.8958554
0 references
