{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:23:47Z","timestamp":1768307027923,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_18","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"255-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Location-Domination Type Problems Under the\u00a0Mycielski Construction"],"prefix":"10.1007","author":[{"given":"Silvia M.","family":"Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7169-7288","authenticated-orcid":false,"given":"Dipayan","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanina","family":"Lucarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annegret K.","family":"Wagler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.dam.2022.06.025","volume":"322","author":"G Argiroffo","year":"2022","unstructured":"Argiroffo, G., Bianchi, S., Lucarini, Y., Wagler, A.: Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. Discrete Appl. Math. 322, 465\u2013480 (2022)","journal-title":"Discrete Appl. Math."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2019.08.001","volume":"281","author":"G Argiroffo","year":"2020","unstructured":"Argiroffo, G., Bianchi, S., Lucarini, Y., Wagler, A.: Linear-time algorithms for three domination-based separation problems in block graphs. Discrete Appl. Math. 281, 6\u201341 (2020)","journal-title":"Discrete Appl. Math."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.entcs.2019.08.013","volume":"346","author":"G Argiroffo","year":"2019","unstructured":"Argiroffo, G., Bianchi, S., Lucarini, Y., Wagler, A.: The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations. Electron. Notes Theor. Comput. Sci. 346, 135\u2013145 (2019)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.endm.2015.07.016","volume":"50","author":"G Argiroffo","year":"2015","unstructured":"Argiroffo, G., Bianchi, S., Wagler, A.: A polyhedral approach to locating-dominating sets in graphs. Electron. Notes Discrete Math. 50, 89\u201394 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ejc.2003.12.013","volume":"25","author":"N Bertrand","year":"2004","unstructured":"Bertrand, N., Charon, I., Hudry, O., Lobstein, A.: Identifying and locating dominating codes on chains and cycles. Eur. J. Comb. 25, 969\u2013987 (2004)","journal-title":"Eur. J. Comb."},{"key":"18_CR6","first-page":"219","volume":"39","author":"N Blidia","year":"2007","unstructured":"Blidia, N., Chellali, M., Maffray, F., Moncel, J., Semri, A.: Locating-domination and identifying codes in trees. Australas. J. Comb. 39, 219\u2013232 (2007)","journal-title":"Australas. J. Comb."},{"key":"18_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-031-25211-2_21","volume-title":"Algorithms and Discrete Applied Mathematics","author":"D Chakraborty","year":"2023","unstructured":"Chakraborty, D., Foucaud, F., Parreau, A., Wagler, A.K.: On three domination-based identification problems in block graphs. In: Bagchi, A., Muthu, R. (eds.) CALDAM 2023. LNCS, vol. 13947, pp. 271\u2013283. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25211-2_21"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","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, 2109\u20132120 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR9","first-page":"227","volume":"160","author":"M Chellali","year":"2009","unstructured":"Chellali, M., Rad, N.J.: Locating-total domination critical graphs. Australas. J. Comb. 160, 227\u2013234 (2009)","journal-title":"Australas. J. Comb."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2021.06.006","volume":"302","author":"F Foucaud","year":"2021","unstructured":"Foucaud, F., Ghareghani, N., Roshany-Tabrizi, A., Sharifani, P.: Characterizing extremal graphs for open neighbourhood location-domination. Discrete Appl. Math. 302, 76\u201379 (2021)","journal-title":"Discrete Appl. Math."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0166-218X(97)00126-1","volume":"84","author":"DC Fisher","year":"1998","unstructured":"Fisher, D.C., McKenna, P.A., Boyer, E.D.: Hamiltonicity, diameter, domination packing and biclique partitions of Mycielski\u2019s graphs. Discrete Appl. Math. 84, 93\u2013105 (1998)","journal-title":"Discrete Appl. Math."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-662-53174-7_32","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Foucaud","year":"2016","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 456\u2013471. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_32"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","volume":"78","author":"F Foucaud","year":"2017","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms Complex. Algorithmica 78, 914\u2013944 (2017)","journal-title":"Algorithms Complex. Algorithmica"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.disc.2005.09.035","volume":"307","author":"S Gravier","year":"2007","unstructured":"Gravier, S., Moncel, J.: On graphs having a $$V\\setminus \\{x\\}$$-set as an identifying code. Discrete Math. 307, 432\u2013434 (2007)","journal-title":"Discrete Math."},{"key":"18_CR15","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, 1293\u20131300 (2006)","journal-title":"Discrete Appl. Math."},{"key":"18_CR16","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 domination in graphs. Discrete Appl. Math. 160, 1986\u20131993 (2012)","journal-title":"Discrete Appl. Math."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s00373-013-1311-2","volume":"30","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Yeo, A.: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs. Graphs Comb. 30, 909\u2013932 (2014)","journal-title":"Graphs Comb."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR19","unstructured":"Lobstein, A., Jean, D.: Watching systems, identifying, locating-dominating and discriminating codes in graphs. https:\/\/dragazo.github.io\/bibdom\/main.pdf"},{"issue":"6","key":"18_CR20","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1017\/S0963548309990344","volume":"18","author":"T Mueller","year":"2009","unstructured":"Mueller, T., Sereni, J.S.: Identifying and locating-dominating codes in (random) geometric networks. Comb. Probab. Comput. 18(6), 925\u2013952 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Pandey, A.: Open neighborhood locating-dominating set in graphs: complexity and algorithms. In: 2015 International Conference on Information Technology (ICIT) IEEE (2015)","DOI":"10.1109\/ICIT.2015.14"},{"key":"18_CR23","first-page":"109","volume":"46","author":"SJ Seo","year":"2010","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating dominating sets. Austral. J. Comb. 46, 109\u2013119 (2010)","journal-title":"Austral. J. Comb."},{"key":"18_CR24","first-page":"309","volume":"11","author":"A Shaminejad","year":"2022","unstructured":"Shaminejad, A., Vatandoost, E., Mirasheh, K.: The identifying code number and Mycielski\u2019s construction of graphs. Trans. Comb. 11, 309\u2013316 (2022)","journal-title":"Trans. Comb."},{"issue":"4","key":"18_CR25","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"Slater, P.J.: Dominating and reference sets in a graph. J. Math. Phys. Sci. 22(4), 445\u2013455 (1988)","journal-title":"J. Math. Phys. Sci."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230170105","volume":"17","author":"PJ Slater","year":"1987","unstructured":"Slater, P.J.: Dominating and location in acyclic graphs. Networks 17, 55\u201364 (1987)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:30Z","timestamp":1768281750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}