Location Domination Number of Sum of Graphs
About this article
DOI:
https://doi.org/10.14419/ijet.v7i4.10.26774Keywords:
vertex non locating dominating set, Dominating set, Locating domination set, Locating set, Sum of graphsAbstract
Locating dominating set is the subset S of the vertex set V(G) which dominate and uniquely identify all vertices of the set V(G)-S . In this paper we formulated the apt method for finding the location domination number of sum of graphs G1+G2 based on the nature of the graphs and G1and G2 .
References
S.R. Canoy, Jr, and G. A. Malacas, Determining the Intruder’s Lo-cation in a Given Network: Locating-Dominating Sets in a Graph, NRCP Research J., 13 (2013), No. 1, 1-8.
C. J. Colbourn, P. J. Slater and L .K. Stewart, Locating-dominating sets in series parallel networks, Congr. Numer., 56 (1987), 135-162.
A. Finbowand B. L. Hartnell, Onlocating-dominating sets and well-covered graphs, Congr. Numer., 56 (1987), 135–162.
F. Foucaud and M.A. Henning, Location-domination in line graphs, Discrete Math., 340 (2017), 3140–3153.
F. Harary and R. A. Melter , On the metric dimension of a graph, Ars Combin., 2, 191-195, 1976.
View more references (8)
C. Hernando, M. Mora and I. M. Pelayo, Nordhaus-Gaddum bounds for locating domination, Eur. J. of Combin., 36 (2014), 1-6.
O. Ore, Theory of Graphs. Amer. Math. Soc. Colloq. Publ., 38, 1962.
G.Rajasekar and K.Nagarajan, Algorithm for finding Location Domination Number of a Graph connected by a Bridge, Int. J. of Pure and Applied Math., 118 (2018), No. 6, 313-321.
G.Rajasekar and K.Nagarajan, Location Domination Number of Graph obtained by the Fusion of Single Vertex, Global J. of Pure and Applied Math., 13(2017), No. 9, 4425–4436.
D. F. Rall and P. J. Slater, On location-domination numbers for cer-tian classes of graphs, Congr. Numer., 45 (1984), 97-106.
P. J. Slater, Fault-tolerant locating-dominating sets, Discrete Math. 249 (2002), 179–189.
P. J. Slater, Dominating and reference sets in a graph, J. Math. Phys. Sci., 22 (1988), 445-455.
P. J. Slater, Dominating and location in acyclic in graphs, Networks, 17 (1987), 55-64.