On the hardness of finding the geodetic number of a subcubic graph

Abstract A set of vertices D of a graph G is geodetic if every vertex of G lies in a shortest path between two vertices in D . The geodetic number of G is the minimum cardinality of a geodetic set of G , and deciding whether it is at most k is an NP-complete problem for several classes of graphs. While the problem is easy for graphs of maximum degree at most 2, we show that the problem is NP-complete for graphs of maximum degree three.

[1]  Mustafa Atici,et al.  Computational Complexity of Geodetic Set , 2002, Int. J. Comput. Math..

[2]  Lutz Volkmann,et al.  On the geodetic and geodetic domination numbers of a graph , 2010, Discret. Math..

[3]  A. P. Santhakumaran,et al.  The upper connected geodetic number and forcing connected geodetic number of a graph , 2009, Discret. Appl. Math..

[4]  Bin Wu,et al.  The Geodetic Number of Cm × Cn , 2009, 2009 International Conference on Management and Service Science.

[5]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[6]  Jayme Luiz Szwarcfiter,et al.  Some remarks on the geodetic number of a graph , 2010, Discret. Math..

[7]  Aleksandra Tepeh,et al.  On the geodetic number and related metric sets in Cartesian product graphs , 2008, Discret. Math..

[8]  Dieter Rautenbach,et al.  The Geodetic Hull Number is Hard for Chordal Graphs , 2017, Electron. Notes Discret. Math..

[9]  Mustafa Atici,et al.  On The Edge Geodetic Number Of A Graph , 2003, Int. J. Comput. Math..

[10]  Li-Da Tong,et al.  The hull and geodetic numbers of orientations of graphs , 2009, Discret. Math..

[11]  Júlio Araújo,et al.  Hull number: P5-free graphs and reduction rules , 2013, Electron. Notes Discret. Math..

[12]  Dieter Rautenbach,et al.  On the geodetic hull number of Pk-free graphs , 2016, Theor. Comput. Sci..