{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:05:46Z","timestamp":1743152746689,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319292205"},{"type":"electronic","value":"9783319292212"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29221-2_26","type":"book-chapter","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T12:02:54Z","timestamp":1455278574000},"page":"299-307","source":"Crossref","is-referenced-by-count":0,"title":["Domination Parameters in Hypertrees"],"prefix":"10.1007","author":[{"given":"R.","family":"Jayagopal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sundara Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"EJ Cockayne","year":"1977","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks 7(3), 247\u2013261 (1977)","journal-title":"Networks"},{"key":"26_CR2","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North Holland Publisher, Amsterdam (1973)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-7-108","volume":"7","author":"T Haynes","year":"2006","unstructured":"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\u2013118 (2006)","journal-title":"BMC Bioinform."},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0097-3165(71)90051-3","volume":"11","author":"JG Kalbeisch","year":"1971","unstructured":"Kalbeisch, J.G., Stanton, R.G., Horton, J.D.: On covering sets and error-correcting codes. J. Combin. Theory Ser. A 11(3), 233\u2013250 (1971)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"8","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","volume":"154","author":"TW Haynes","year":"2006","unstructured":"Haynes, T.W., Henning, M.A., Howard, J.: Locating and total dominating sets in trees. Discrete Appl. Math. 154(8), 1293\u20131300 (2006)","journal-title":"Discrete Appl. Math."},{"key":"26_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of Np-Completeness","author":"MR Garey","year":"1979","unstructured":"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)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2006","unstructured":"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\u20132120 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR8","first-page":"177","volume":"49","author":"G Exoo","year":"2011","unstructured":"Exoo, G.: Locating-dominating codes in cycles. Australas. J. Combin. 49, 177\u2013194 (2011)","journal-title":"Australas. J. Combin."},{"issue":"15","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1016\/j.dam.2011.06.008","volume":"159","author":"C Chen","year":"2011","unstructured":"Chen, C., Lu, C., Miao, Z.: Identifying codes and locating-dominating sets on paths and cycles. Discrete Appl. Math. 159(15), 1540\u20131547 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejc.2004.09.002","volume":"27","author":"I Honkala","year":"2006","unstructured":"Honkala, I., Laihonen, T.: On locating-dominating sets in infinite grids. Eur. J. Combin. 27(2), 218\u2013227 (2006)","journal-title":"Eur. J. Combin."},{"issue":"13\u201314","key":"26_CR11","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1016\/j.dam.2013.03.008","volume":"161","author":"M Ghebleha","year":"2013","unstructured":"Ghebleha, M., Niepelb, L.: Locating and identifying codes in circulant networks. Discrete Appl. Math. 161(13\u201314), 2001\u20132007 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"26_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","volume":"249","author":"PJ Slater","year":"2002","unstructured":"Slater, P.J.: Fault-tolerant locating-dominating sets. Discrete Math. 249(1\u20133), 179\u2013189 (2002)","journal-title":"Discrete Math."},{"issue":"8","key":"26_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.dam.2010.12.025","volume":"159","author":"X Chena","year":"2011","unstructured":"Chena, X., Sohn, M.Y.: Bounds on the locating-total domination number of a tree. Discrete Appl. Math. 159(8), 769\u2013773 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"13\u201314","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1016\/j.dam.2012.04.004","volume":"160","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., Rad, N.J.: Locating-total dominations in graphs. Discrete Appl. Math. 160(13\u201314), 1986\u20131993 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"48","key":"26_CR15","doi-asserted-by":"publisher","first-page":"2363","DOI":"10.12988\/ams.2014.43205","volume":"8","author":"BN Omamalin","year":"2014","unstructured":"Omamalin, B.N.: Locating total dominating sets in the join, corona and composition of graphs. Appl. Math. Sci. 8(48), 2363\u20132374 (2014)","journal-title":"Appl. Math. Sci."},{"issue":"4","key":"26_CR16","doi-asserted-by":"publisher","first-page":"3107","DOI":"10.1016\/j.disc.2012.06.024","volume":"312","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., Lowenstein, C.: Locating-total domination in claw-free cubic graphs. Discrete Math. 312(4), 3107\u20133116 (2012)","journal-title":"Discrete Math."},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.7151\/dmgt.1538","volume":"31","author":"M Blidia","year":"2011","unstructured":"Blidia, M., Dali, W.: A characterization of locating-total domination edge critical graphs. Discussiones Math. Graph Theory 31(1), 197\u2013202 (2011)","journal-title":"Discussiones Math. Graph Theory"},{"issue":"12","key":"26_CR18","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TC.1981.1675731","volume":"C\u201330","author":"JR Goodman","year":"1981","unstructured":"Goodman, J.R., Sequin, C.H.: Hypertree: a multiprocessor interconnection topology. IEEE Trans. Comput. C\u201330(12), 923\u2013933 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.procs.2015.07.393","volume":"57","author":"RS Rajan","year":"2015","unstructured":"Rajan, R.S., Jayagopal, R., Rajasingh, I., Rajalaxmi, T.M., Parthiban, N.: Combinatorial properties of root-fault hypertree. Procedia Comput. Sci. 57, 1096\u20131103 (2015)","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29221-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:32:50Z","timestamp":1559385170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29221-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319292205","9783319292212"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29221-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}