{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:36:07Z","timestamp":1774334167488,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_14","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:00Z","timestamp":1770977220000},"page":"203-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Perfect (1,\u00a02)-Dominating Sets in\u00a0Low-Degree Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4856-9613","authenticated-orcid":false,"given":"Urszula","family":"Bednarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8776-5270","authenticated-orcid":false,"given":"Adrian","family":"Michalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.3390\/sym17030405","volume":"17","author":"U Bednarz","year":"2025","unstructured":"Bednarz, U.: On the existence of perfect $$(1,2)$$-dominating sets in graphs. Symmetry 17(3), 405 (2025)","journal-title":"Symmetry"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7494\/OpMath.2025.45.1.53","volume":"45","author":"U Bednarz","year":"2025","unstructured":"Bednarz, U., Pirga, M.: $$(1,2)$$-PDS in graphs with the small number of vertices of large degrees. Opuscula Math. 45(1), 53\u201362 (2025)","journal-title":"Opuscula Math."},{"key":"14_CR3","volume-title":"The Theory of Graphs and Its Applications","author":"C Berge","year":"1962","unstructured":"Berge, C.: The Theory of Graphs and Its Applications. Wiley, New York (1962)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"15","author":"N Biggs","year":"1973","unstructured":"Biggs, N.: Perfect codes in graphs. J. Comb. Theory (B) 15, 289\u2013296 (1973)","journal-title":"J. Comb. Theory (B)"},{"key":"14_CR5","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2005)"},{"issue":"1","key":"14_CR6","first-page":"793","volume":"29","author":"I Dvo\u0159\u00e1kov\u00e1-Ruli\u0107ov\u00e1","year":"1988","unstructured":"Dvo\u0159\u00e1kov\u00e1-Ruli\u0107ov\u00e1, I.: Perfect codes in regular graphs. Comment. Math. Univ. Carol. 29(1), 793\u201383 (1988)","journal-title":"Comment. Math. Univ. Carol."},{"key":"14_CR7","unstructured":"Fink, J.F., Jacobson, M.S.: $$n$$-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 283\u2013300, Wiley, New York (1985)"},{"key":"14_CR8","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"issue":"2","key":"14_CR9","first-page":"103","volume":"5","author":"SM Hedetniemi","year":"2008","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Knisely, J., Rall, D.F.: Secondary domination in graphs. AKCE J. Graphs. Combin. 5(2), 103\u2013115 (2008)","journal-title":"AKCE J. Graphs. Combin."},{"issue":"1\u20133","key":"14_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: Regular codes in regular graphs are difficult. Discret. Math. 133(1\u20133), 191\u2013205 (1994)","journal-title":"Discret. Math."},{"key":"14_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs, vol. 38. American Mathematical Society, Providence (1962)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.3390\/sym13122399","volume":"13","author":"A Michalski","year":"2021","unstructured":"Michalski, A., Bednarz, P.: On independent secondary dominating sets in generalized graph products. Symmetry 13, 2399 (2021)","journal-title":"Symmetry"},{"key":"14_CR13","volume":"377","author":"A Michalski","year":"2020","unstructured":"Michalski, A., W\u0142och, I.: On the existence and the number of independent $$(1,2)$$-dominating sets in the G-join of graphs. Appl. Math. Comput. 377, 125155 (2020)","journal-title":"Appl. Math. Comput."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"7050","DOI":"10.1002\/mma.8223","volume":"45","author":"A Michalski","year":"2022","unstructured":"Michalski, A., W\u0142och, I., Dettlaff, M., Lema\u0144ska, M.: On proper $$(1,2)$$-dominating sets in graphs. Math. Models Appl. Sci. 45, 7050\u20137057 (2022)","journal-title":"Math. Models Appl. Sci."},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(84)90113-4","volume":"49","author":"J Plesn\u00edk","year":"1984","unstructured":"Plesn\u00edk, J.: A note on the complexity of finding regular subgraphs. Discret. Math. 49(2), 161\u2013167 (1984)","journal-title":"Discret. Math."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.3390\/electronics11030300","volume":"11","author":"J Raczek","year":"2022","unstructured":"Raczek, J.: Polynomial algorithm for minimal $$(1, 2)$$-dominating set in networks. Electronics 11(3), 300 (2022)","journal-title":"Electronics"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/s00453-023-01192-2","volume":"86","author":"J Raczek","year":"2024","unstructured":"Raczek, J.: Complexity issues on of secondary domination number. Algorithmica 86, 1163\u20131172 (2024)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:13:56Z","timestamp":1774325636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}