On the hardness of finding the geodetic number of a subcubic graph (Q1708262)
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 the hardness of finding the geodetic number of a subcubic graph |
scientific article; zbMATH DE number 6856063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of finding the geodetic number of a subcubic graph |
scientific article; zbMATH DE number 6856063 |
Statements
On the hardness of finding the geodetic number of a subcubic graph (English)
0 references
5 April 2018
0 references
geodetic number
0 references
geodetic set
0 references
geodetic convexity
0 references
computational complexity
0 references
maximum degree three
0 references
0.9086911
0 references
0.89899814
0 references
0.88695997
0 references
0.88628864
0 references
0.88628864
0 references
0 references
0 references
0.88322973
0 references
