{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:58:13Z","timestamp":1760043493995},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T00:00:00Z","timestamp":1458777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10998-016-0121-8","type":"journal-article","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T15:41:09Z","timestamp":1458834069000},"page":"224-234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Locating-dominating sets in hypergraphs"],"prefix":"10.1007","volume":"72","author":[{"given":"Muhammad","family":"Fazil","sequence":"first","affiliation":[]},{"given":"Imran","family":"Javaid","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Salman","sequence":"additional","affiliation":[]},{"given":"Usman","family":"Ali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,24]]},"reference":[{"key":"121_CR1","unstructured":"B.D. Acharya, Domination in hypergraphs II, new directions, in Proceedings of International Conference ICDM (Mysore, 2008), pp. 1\u201316"},{"issue":"2","key":"121_CR2","first-page":"117","volume":"4","author":"BD Acharya","year":"2007","unstructured":"B.D. Acharya, Domination in hypergraphs. AKCE J. Combin. 4(2), 117\u2013126 (2007)","journal-title":"AKCE J. Combin."},{"key":"121_CR3","volume-title":"Hypergraphs: Combinatoric of Finite Sets","author":"C Berg","year":"1989","unstructured":"C. Berg, Hypergraphs: Combinatoric of Finite Sets (Elsevier, North-Holland, 1989)"},{"key":"121_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(97)00244-6","volume":"187","author":"A Behr","year":"1998","unstructured":"A. Behr, L. Camarinopoulos, On the domination of hypergraphs by their edges. Discret. Math. 187, 31\u201338 (1998)","journal-title":"Discret. Math."},{"key":"121_CR5","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ejc.2003.12.013","volume":"25","author":"N Bertrand","year":"2004","unstructured":"N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25, 969\u2013987 (2004)","journal-title":"Eur. J. Comb."},{"key":"121_CR6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.amc.2013.05.060","volume":"220","author":"J Caceres","year":"2013","unstructured":"J. Caceres, C. Hernando, M. Mora, I.M. Pelayo, M.L. Puertas, Locating dominating codes. Appl. Math. Comput. 220, 38\u201345 (2013)","journal-title":"Appl. Math. Comput."},{"key":"121_CR7","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","unstructured":"I. Charon, O. Hudry, A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290, 2109\u20132120 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"121_CR8","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1109\/TIT.2002.800490","volume":"48","author":"I Charon","year":"2002","unstructured":"I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Trans. Inform. Theory 48, 2192\u20132200 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"121_CR9","first-page":"135","volume":"56","author":"CJ Colbourn","year":"1987","unstructured":"C.J. Colbourn, P.J. Slater, L.K. Stewart, Locating-dominating sets in series parallel networks. Congr. Numer. 56, 135\u2013162 (1987)","journal-title":"Congr. Numer."},{"key":"121_CR10","first-page":"135","volume":"56","author":"A Finbow","year":"1987","unstructured":"A. Finbow, B.L. Hartnell, On locating-dominating sets and well-covered graphs. Congr. Numer. 56, 135\u2013162 (1987)","journal-title":"Congr. Numer."},{"key":"121_CR11","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"F. Harary, R.A. Melter, On the metric dimention of a graph. Ars Comb. 2, 191\u2013195 (1976)","journal-title":"Ars Comb."},{"key":"121_CR12","first-page":"265","volume":"6","author":"I Honkala","year":"2004","unstructured":"I. Honkala, T. Laihonen, S. Ranto, On locating-dominating codes in binary Hamming spaces. Disc. Math. Theor. Comput. Sci. 6, 265\u2013282 (2004)","journal-title":"Disc. Math. Theor. Comput. Sci."},{"key":"121_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.2298\/AADM0902347J","volume":"3","author":"BK Jose","year":"2009","unstructured":"B.K. Jose, Z. Tuza, Hypergraph domination and strong independnce. Appl. Anal. Disc. Math. 3, 347\u2013358 (2009)","journal-title":"Appl. Anal. Disc. Math."},{"key":"121_CR14","first-page":"97","volume":"45","author":"DF Rall","year":"1984","unstructured":"D.F. Rall, P.J. Slater, On location-domination numbers for certian classes of graphs. Congr. Numer. 45, 97\u2013106 (1984)","journal-title":"Congr. Numer."},{"key":"121_CR15","volume-title":"Fractional graph theory","author":"ER Scheinerman","year":"2008","unstructured":"E.R. Scheinerman, D.H. Ullman, Fractional graph theory (Wiley, New York, 2008)"},{"key":"121_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","volume":"249","author":"PJ Slater","year":"2002","unstructured":"P.J. Slater, Fault-tolerant locating-dominating sets. Discret. Math. 249, 179\u2013189 (2002)","journal-title":"Discret. Math."},{"key":"121_CR17","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"P.J. Slater, Dominating and reference sets in a graph. J. Math. Phys. Sci. 22, 445\u2013455 (1988)","journal-title":"J. Math. Phys. Sci."},{"key":"121_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230170105","volume":"17","author":"PJ Slater","year":"1987","unstructured":"P.J. Slater, Dominating and location in acyclic in graphs. Networks 17, 55\u201364 (1987)","journal-title":"Networks"},{"key":"121_CR19","unstructured":"P.J. Slater, Leaves of trees. in Proceedings of 6th Southeastern Conference on Combinatorics, Graph theory, and Computing. Congressus Numerantium, vol 14 (1975), pp 549\u2013559"}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0121-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-016-0121-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0121-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:53:06Z","timestamp":1559353986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-016-0121-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,24]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s10998-016-0121-8","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,24]]}}}