{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:54Z","timestamp":1740107094708,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 170450- 2013","RGPIN 2017-04401"],"award-info":[{"award-number":["RGPIN 170450- 2013","RGPIN 2017-04401"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00373-020-02202-8","type":"journal-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T09:04:11Z","timestamp":1591952651000},"page":"1477-1487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Domination Polynomials"],"prefix":"10.1007","volume":"36","author":[{"given":"Iain","family":"Beaton","sequence":"first","affiliation":[]},{"given":"Jason I.","family":"Brown","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3432-0083","authenticated-orcid":false,"given":"Danielle","family":"Cox","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"key":"2202_CR1","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1016\/j.ejc.2010.03.007","volume":"31","author":"S Akbari","year":"2010","unstructured":"Akbari, S., Alikhani, S., Peng, Y.H.: Characterization of graphs using domination polynomials. Eur. J. Comb. 31, 1714\u20131724 (2010)","journal-title":"Eur. J. Comb."},{"key":"2202_CR2","first-page":"257","volume":"114","author":"S Alikhani","year":"2014","unstructured":"Alikhani, S., Peng, Y.: Introduction to domination polynomial of a graph. ARS. Combin. 114, 257\u2013266 (2014)","journal-title":"ARS. Combin."},{"key":"2202_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0269964800143074","volume":"14","author":"Y Ath","year":"2011","unstructured":"Ath, Y., Sobel, M.: Some conjectured uniformly optimal reliable networks. Probab. Eng. Inf. Sci. 14, 375\u2013383 (2011)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"2202_CR4","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/26.61483","volume":"38","author":"FT Boesch","year":"1990","unstructured":"Boesch, F.T., Satyanarayana, A., Suffel, C.L.: Least reliable networks and the reliability domination. IEEE Trans. Commun. 38, 2004\u20132009 (1990)","journal-title":"IEEE Trans. Commun."},{"key":"2202_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230210204","volume":"21","author":"F Boesch","year":"1991","unstructured":"Boesch, F., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21, 181\u2013194 (1991)","journal-title":"Networks"},{"key":"2202_CR6","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/net.21530","volume":"63","author":"JI Brown","year":"2014","unstructured":"Brown, J.I., Cox, D.: Nonexistence of optimal graphs for all terminal reliability. Networks 63, 146\u2013153 (2014)","journal-title":"Networks"},{"issue":"6","key":"2202_CR7","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1007\/s00373-018-1946-0","volume":"34","author":"JI Brown","year":"2018","unstructured":"Brown, J.I., Cox, D.: Optimal graphs for Independence and $$k$$-Independence polynomials. Graphs Comb. 34(6), 1445\u20131457 (2018)","journal-title":"Graphs Comb."},{"issue":"1","key":"2202_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/6","volume":"19","author":"Klaus Dohmen","year":"2012","unstructured":"Dohmen, Klaus, Tittmann, Peter, Reliability, Domination: Electr. J. Comb. 19(1), 1\u201314 (2012)","journal-title":"Electr. J. Comb."},{"key":"2202_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<217::AID-NET2>3.0.CO;2-G","volume":"31","author":"D Gross","year":"1998","unstructured":"Gross, D., Saccoman, J.T.: Uniformly optimal reliable graphs. Networks 31, 217\u2013225 (1998)","journal-title":"Networks"},{"key":"2202_CR10","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/net.3230210404","volume":"21","author":"W Myrvold","year":"1991","unstructured":"Myrvold, W., Cheung, K.H., Page, L.B., Perry, J.E.: Uniformly most reliable networks do not always exist. Networks 21, 417\u2013419 (1991)","journal-title":"Networks"},{"key":"2202_CR11","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/jgt.3190190407","volume":"19","author":"A Sakaloglu","year":"1995","unstructured":"Sakaloglu, A., Satyanarayana, A.: Graphs with the least number of colourings. J. Graph Theory 19, 523\u2013533 (1995)","journal-title":"J. Graph Theory"},{"issue":"11","key":"2202_CR12","doi-asserted-by":"publisher","first-page":"2228","DOI":"10.1016\/j.disc.2007.04.069","volume":"308","author":"I Simonelli","year":"2008","unstructured":"Simonelli, I.: Optimal graphs for chromatic polynomials. Discrete Math. 308(11), 2228\u20132239 (2008)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02202-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02202-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02202-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T23:22:41Z","timestamp":1623453761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02202-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2202"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02202-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,6,12]]},"assertion":[{"value":"15 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}