{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:01Z","timestamp":1740107101513,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T00:00:00Z","timestamp":1620172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T00:00:00Z","timestamp":1620172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00373-021-02307-8","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T14:04:09Z","timestamp":1620223449000},"page":"1215-1228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Conjecture for Power Domination"],"prefix":"10.1007","volume":"37","author":[{"given":"Min","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6127-6383","authenticated-orcid":false,"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"2307_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2018.06.004","volume":"251","author":"KF Benson","year":"2018","unstructured":"Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V.: Nordhaus\u2013Gaddum problems for power domination. Discrete Appl. Math. 251, 103\u2013113 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2307_CR2","first-page":"221","volume":"70","author":"KF Benson","year":"2018","unstructured":"Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., Wissman, B.: Zero forcing and power domination for graph products. Australas. J. Combin. 70, 221\u2013235 (2018)","journal-title":"Australas. J. Combin."},{"key":"2307_CR3","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/s10878-018-0330-6","volume":"37","author":"C Bozeman","year":"2019","unstructured":"Bozeman, C., Brimkov, B., Erickson, C., Ferrero, D., Flagg, M., Hogben, L.: Restricted powerdomination and zero forcing problems. J. Combin. Optim. 37, 935\u201395 (2019)","journal-title":"J. Combin. Optim."},{"key":"2307_CR4","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/S0895480103432556","volume":"19","author":"DJ Brueni","year":"2005","unstructured":"Brueni, D.J., Heath, L.S.: The PMU placement problem. SIAM J. Discrete Math. 19, 744\u2013761 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"2307_CR5","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/060661879","volume":"22","author":"P Dorbec","year":"2008","unstructured":"Dorbec, P., Mollard, M., Klav\u017ear, S., \u0160pacapan, S.: Power domination in product graphs. SIAM J. Discrete Math. 22, 554\u2013567 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"2307_CR6","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1137\/120891356","volume":"27","author":"P Dorbec","year":"2013","unstructured":"Dorbec, P., Henning, M., L\u00f6wenstein, C., Montassier, M., Raspaud, A.: Generalized power domination in regular graphs. SIAM J. Discrete Math. 27, 1559\u20131574 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2307_CR7","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.dam.2005.08.006","volume":"154","author":"M Dorfling","year":"2006","unstructured":"Dorfling, M., Henning, M.A.: A note on power domination in grid graphs. Discrete Appl. Math. 154, 1023\u20131027 (2006)","journal-title":"Discrete Appl. Math."},{"key":"2307_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15, 519\u2013529 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"2307_CR9","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, New York (1998)"},{"key":"2307_CR10","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-014-9785-2","volume":"31","author":"C Liao","year":"2016","unstructured":"Liao, C.: Power domination with bounded time constraints. J. Combin. Optim. 31, 725\u2013742 (2016)","journal-title":"J. Combin. Optim."},{"key":"2307_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus, E.A., Gaddum, J.W.: On complementary graphs. Am. Math. Mon. 63, 175\u2013177 (1956)","journal-title":"Am. Math. Mon."},{"key":"2307_CR12","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1016\/j.disc.2006.03.037","volume":"306","author":"M Zhao","year":"2006","unstructured":"Zhao, M., Kang, L., Chang, G.J.: Power domination in graphs. Discrete Math. 306, 1812\u20131816 (2006)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02307-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02307-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02307-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T07:11:50Z","timestamp":1625037110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02307-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,5]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2307"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02307-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,5,5]]},"assertion":[{"value":"11 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}