Some results on the open locating-total domination number in graphs

Document Type : Research Paper

Authors

1 Department of Mathematics, Golestan University, Gorgan, Iran

2 Department of Mathematics, Estahban Branch, Islamic Azad University Estahban, Iran

Abstract

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 if the set $S$ is a total dominating set of $G$ and for any pair of distinct vertices $x$ and $y$ in $V(G)$, $N(x) \cap S\neq N(y) \cap S$. The open locating-total domination number, denoted $\gamma_{t}^{OL}(G)$, of $G$ is the minimum cardinality of an open locating-total dominating set. In this paper, we determine the open locating-total dominating set of some families of graphs. Also, the open locating-total domination number is calculated for two families of trees. The present paper is an extended version of our paper, presented at the 52nd Annual Iranian Mathematics Conference, Shahid Bahonar University of Kerman, Iran, 2021.

Keywords


[1] M. Chellali, N. Jafari Rad, Locating-total domination critical graphs, Australas. J. Combin, vol. 45 (2009) 227{234.
[2] M. Chellali, N. Jafari Rad, S. J. Seo, P. J. Slater, On open neighborhood locatingdominating in graphs, Electron. J. Graph Theory Appl, vol. 2 no. 2 (2014), 87{98.
[3] X. G. Chen, M. Y. Sohn, Bounds on the locating-total domination number of a tree, Discrete Appl. Math, vol. 159 (2011) 769{773.
[4] R. Frucht, F. Harary, On the corona of two graphs, Aequationes Math, vol. 4 (1970) 322{324.
[5] D. Da k, I. H. Agustin, Moh. Hasan, R. Adawiyah, R. Alfarisi, D. A. R. Wardani, On the Locating Edge Domination Number of Comb Product of Graphs, IOP Conf. Series:Journal of Physics: Conf. Series, vol. 1022 (2018) 012003.
[6] T. W. Haynes, M. A. Henning, J. Howard,Locating and total dominating sets in trees, Discrete Appl. Math, vol. 154 (2006) 1293{1300.
[7] T. W. Haynes, M. A. Henning, P. J. Slater and L. C. van der Merwe, The complementary product of two graphs. Bull. Instit. Combin. Appl. vol. 51 (2007) 21{30.
[8] C. Hernando, M. Mora, I. M. Pelayo, Locating domination in bipartite graphs and their complements, Discrete Appl. Math, Vol. 263 (2019) 195{203.
[9] I. Honkala, T. Laihonen, S. Ranto, On strongly identifying codes, Discrete Math, vol. 254 (2002), 191{205.
[10] N. Jafari Rad, H. Rahbani, A note on the locating-total domination number in trees, Australas. J. Combin, vol. 66 (2016) 420{424.
[11] K. R. S. Holmes, Locating-Domination in Complementary Prisms, thesis, East Tennessee State University, 2009.
[12] F. Movahedi, M. H. Akhbari, Some results on the open locating-total domination number in graphs, 52nd Annual Iranian Mathematics Conference, Shahid Bahonar University of Kerman, Iran, 2021.
[13] H. Raza, N. Iqbal, H. Khan, T. Botmart, Computing locating-total domination number in some rotationally symmetric graphs, Sci. Prog, vol. 104, no. 4 (2021), 1{18.
[14] P. J. Slater, Domination and location in acyclic graphs, Networks, vol. 17 (1987), 55{64.
[15] P. J. Slater, Dominating and reference sets in a graph, J. Math. Phys. Sciences, vol. 22 (1988), 445{455.
[16] S. Seo, P. Slater, Open Neighborhood locating-dominating sets, Australas. J. Combin, vol. 46 (2010) 109{119.
[17] S. Seo, P. Salter, Open neighborhood locating-dominating in trees, Discrete Appl. Math, vol. 159 (2011) 484{489.
[18] P. J. Slater, Leaves of trees, Congr. Numer, vol. 14 (1975), 549{559.
[19] K. Wang, W. Ning, M. Lu, Bounds on the Locating-Total Domination Number in Trees, Discuss. Math. Graph Theory, vol. 40, no. 1 (2020), 25{34.
[20] D. A. R.Wardani, Da k, I. H. Agustin, The locating dominating set (LDS) of generalized of corona product of path graph and any graphs, J. Phys.: Conf. Ser. vol. 1465 (2020), 012028.