Abstract
A locating-dominating set (LDS) S of a graph G is a dominating set S of G such that for every two vertices u and v in \(V(G) \setminus S\), \(N(u)\cap S \ne N(v)\cap S\). The locating-domination number \(\gamma ^{L}(G)\) is the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees.
I. Rajasingh—This work is supported by Project No. SR/S4/MS: 846/13, Department of Science and Technology, SERB, Government of India.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks 7(3), 247–261 (1977)
Berge, C.: Graphs and Hypergraphs. North Holland Publisher, Amsterdam (1973)
Haynes, T., Knisley, D., Seier, E., Zou, Y.: A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 7, 108–118 (2006)
Kalbeisch, J.G., Stanton, R.G., Horton, J.D.: On covering sets and error-correcting codes. J. Combin. Theory Ser. A 11(3), 233–250 (1971)
Haynes, T.W., Henning, M.A., Howard, J.: Locating and total dominating sets in trees. Discrete Appl. Math. 154(8), 1293–1300 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of Np-Completeness. W. H. Freeman Company Publisher, San Francisco (1979)
Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoret. Comput. Sci. 290(3), 2109–2120 (2006)
Exoo, G.: Locating-dominating codes in cycles. Australas. J. Combin. 49, 177–194 (2011)
Chen, C., Lu, C., Miao, Z.: Identifying codes and locating-dominating sets on paths and cycles. Discrete Appl. Math. 159(15), 1540–1547 (2011)
Honkala, I., Laihonen, T.: On locating-dominating sets in infinite grids. Eur. J. Combin. 27(2), 218–227 (2006)
Ghebleha, M., Niepelb, L.: Locating and identifying codes in circulant networks. Discrete Appl. Math. 161(13–14), 2001–2007 (2013)
Slater, P.J.: Fault-tolerant locating-dominating sets. Discrete Math. 249(1–3), 179–189 (2002)
Chena, X., Sohn, M.Y.: Bounds on the locating-total domination number of a tree. Discrete Appl. Math. 159(8), 769–773 (2011)
Henning, M.A., Rad, N.J.: Locating-total dominations in graphs. Discrete Appl. Math. 160(13–14), 1986–1993 (2012)
Omamalin, B.N.: Locating total dominating sets in the join, corona and composition of graphs. Appl. Math. Sci. 8(48), 2363–2374 (2014)
Henning, M.A., Lowenstein, C.: Locating-total domination in claw-free cubic graphs. Discrete Math. 312(4), 3107–3116 (2012)
Blidia, M., Dali, W.: A characterization of locating-total domination edge critical graphs. Discussiones Math. Graph Theory 31(1), 197–202 (2011)
Goodman, J.R., Sequin, C.H.: Hypertree: a multiprocessor interconnection topology. IEEE Trans. Comput. C–30(12), 923–933 (1981)
Rajan, R.S., Jayagopal, R., Rajasingh, I., Rajalaxmi, T.M., Parthiban, N.: Combinatorial properties of root-fault hypertree. Procedia Comput. Sci. 57, 1096–1103 (2015)
Acknowledgement
The authors would like to thank the anonymous referees for their comments and suggestions. These comments and suggestions were very helpful for improving the quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jayagopal, R., Rajasingh, I., Sundara Rajan, R. (2016). Domination Parameters in Hypertrees. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-29221-2_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29220-5
Online ISBN: 978-3-319-29221-2
eBook Packages: Computer ScienceComputer Science (R0)