Computing locating-total domination number in some rotationally symmetric graphs
Keyword(s):
Let [Formula: see text] be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices [Formula: see text], such that [Formula: see text]. The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as [Formula: see text]. In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.
2019 ◽
Vol 11
(01)
◽
pp. 1950004
2020 ◽
Vol 8
(4S5)
◽
pp. 272-276
Keyword(s):
2011 ◽
Vol 3
(3)
◽
pp. 547-555
◽
2020 ◽
Vol 8
(4S5)
◽
pp. 221-226