Title
On the hardness of finding the geodetic number of a subcubic graph.
Abstract
•Natural question and interesting results on geodetic number problem.•Dichotomy related to the NP-completeness of such a problem.•Surprising hardness result using a very nice technique
Year
DOI
Venue
2018
10.1016/j.ipl.2018.02.012
Information Processing Letters
Keywords
Field
DocType
geodetic number,geodetic set,geodetic convexity,computational complexity,maximum degree three
Graph,Discrete mathematics,Geodetic datum,Combinatorics,Shortest path problem,Vertex (geometry),Cardinality,Degree (graph theory),Mathematics
Journal
Volume
ISSN
Citations 
135
0020-0190
0
PageRank 
References 
Authors
0.34
8
6
Name
Order
Citations
PageRank
Letícia Rodrigues Bueno122.42
Lucia Draque Penso219620.46
Fábio Protti335746.14
Victor R. Ramos400.34
Dieter Rautenbach5946138.87
Uéverton S. Souza62021.12