{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:54:22Z","timestamp":1743101662190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_17","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"128-133","source":"Crossref","is-referenced-by-count":1,"title":["(1, 2)-Domination in Graphs"],"prefix":"10.1007","author":[{"given":"K.","family":"Kayathri","sequence":"first","affiliation":[]},{"given":"S.","family":"Vallirani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"17_CR1","first-page":"33","volume":"199","author":"KAS Factor","year":"2009","unstructured":"Factor, K.A.S., Langley, L.J.: An introduction to (1, 2)-domination graphs. Congr. Numer. 199, 33\u201338 (2009)","journal-title":"Congr. Numer."},{"issue":"1","key":"17_CR2","first-page":"51","volume":"8","author":"KAS Factor","year":"2011","unstructured":"Factor, K.A.S., Langley, L.J.: A characterization of connected (1, 2)- domination graphs of tournaments. AKCE Int. J. Graphs Comb. 8(1), 51\u201362 (2011)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"2","key":"17_CR3","first-page":"103","volume":"5","author":"SM Hedetniemi","year":"2008","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Rall, D.F., Knisely, J.: Secondary domination in graphs. AKCE Int. J. Graphs Comb. 5(2), 103\u2013115 (2008)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"2","key":"17_CR4","first-page":"239","volume":"6","author":"JT Hedetniemi","year":"2009","unstructured":"Hedetniemi, J.T., Hedetniemi, K.D., Hedetniemi, S.M., Hedetniemi, S.T.: Secondary and internal distances of sets in graphs. AKCE Int. J. Graphs Comb. 6(2), 239\u2013266 (2009)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"1","key":"17_CR5","first-page":"85","volume":"9","author":"JT Hedetniemi","year":"2012","unstructured":"Hedetniemi, J.T., Hedetniemi, K.D., Hedetniemi, S.M., Hedetniemi, S.T.: Secondary and internal distances of sets in graphs II. AKCE Int. J. Graphs Comb. 9(1), 85\u2013113 (2012)","journal-title":"AKCE Int. J. Graphs Comb."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T22:45:59Z","timestamp":1508885159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}