Abstract Given two vertices u and v of a nontrivial connected graph G , the set I [ u , v ] consists all vertices lying on some u − v geodesic in G , including u and v . For S ⊆ V ( G ) , the set I [ S ] is the union of all sets I [ u , v ] for u , v ∈ S . A set S ⊆ V ( G ) is a total restrained geodetic set of G if I [ S ] = V ( G ) and the subgraphs induced by S and V ( G ) − S have no isolated vertex. The minimum cardinality of a total restrained geodetic set of G is the total restrained geodetic number g t r ( G ) of G and a total restrained geodetic set of G whose cardinality equals g t r ( G ) is a minimum total restrained geodetic set of G . A subset T of a minimum total restrained geodetic set S is a forcing subset for S if S is the unique minimum total restrained geodetic set of G containing T . The forcing total restrained geodetic number f t r ( S ) of S is the minimum cardinality of a forcing subset of S and the forcing total restrained geodetic number f t r ( G ) of G is the minimum forcing total restrained geodetic number among all minimum total restrained geodetic sets of G . In this article we determine all pairs a , b of integers such that f t r ( G ) = a and g t r ( G ) = b for some nontrivial connected graph G . Moreover, we show that the decision problem regarding that the total restrained geodetic number of a graph will be less than some positive integer r is NP-complete even when restricted to chordal graph.
[1]
Mustafa Atici,et al.
Computational Complexity of Geodetic Set
,
2002,
Int. J. Comput. Math..
[2]
F. Harary,et al.
The geodetic number of a graph
,
1993
.
[3]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[4]
Li-Da Tong.
The forcing hull and forcing geodetic numbers of graphs
,
2009,
Discret. Appl. Math..
[5]
Ping Zhang.
The Upper Forcing Geodetic Number of a Graph
,
2002,
Ars Comb..
[6]
Vladimir Samodivkin,et al.
On the forcing connected geodetic number and the connected geodetic number of a graph
,
2016,
Ars Comb..
[7]
Gary Chartrand,et al.
The forcing geodetic number of a graph
,
1999,
Discuss. Math. Graph Theory.
[8]
Frank Harary,et al.
Convexity in graphs
,
1981
.
[9]
Gary Chartrand,et al.
The Forcing Convexity Number of a Graph
,
2001
.
[10]
Li-Da Tong.
The (a, b)-forcing geodetic graphs
,
2009,
Discret. Math..
[12]
Jayme Luiz Szwarcfiter,et al.
Some remarks on the geodetic number of a graph
,
2010,
Discret. Math..