Some results on the open locating-total domination number in graphs
In this paper, we generalize the concept of an open locating-dominating set in graphs. We introduce a concept as an open locating-total dominating set in graphs that is equivalent to the open neighborhood locating-dominating set. A vertex set $S \subseteq V(G)$ is an open locating-total dominating i...
Main Authors: | Fateme Movahedi, Mohammad Hadi Akhbari |
---|---|
Format: | Article |
Language: | English |
Published: |
Shahid Bahonar University of Kerman
2023-01-01
|
Series: | Journal of Mahani Mathematical Research |
Subjects: | |
Online Access: | https://jmmrc.uk.ac.ir/article_3325_79f9b969ef43bf7e7129c1d93494c7b4.pdf |
Similar Items
-
A Note on the Locating-Total Domination in Graphs
by: Miller Mirka, et al.
Published: (2017-08-01) -
Double total domination number of Cartesian product of paths
by: Linyu Li, et al.
Published: (2023-02-01) -
Bounds on the Locating-Total Domination Number in Trees
by: Wang Kun, et al.
Published: (2020-02-01) -
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
by: Rad Nader Jafari, et al.
Published: (2018-05-01) -
On open neighborhood locating-dominating in graphs
by: Mustapha Chellali, et al.
Published: (2014-10-01)