We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Computing locating-total domination number in some rotationally symmetric graphs.
- Authors
Raza, Hassan; Iqbal, Naveed; Khan, Hamda; Botmart, Thongchai
- Abstract
Let G = (V , E) 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 i , j ∈ V (G) ∖ S , such that N (i) ∩ S ≠ N (j) ∩ S. The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as γ t L. 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.
- Subjects
DOMINATING set; GRAPH connectivity; POLYTOPES
- Publication
Science Progress, 2021, p1
- ISSN
0036-8504
- Publication type
Article
- DOI
10.1177/00368504211053417