{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:02:28Z","timestamp":1760598148249,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"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 2018-05227"],"award-info":[{"award-number":["RGPIN 2018-05227"]}],"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":[[2022,6]]},"DOI":"10.1007\/s00373-022-02487-x","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T16:03:12Z","timestamp":1652112192000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Unimodality of Domination Polynomials"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5464-8166","authenticated-orcid":false,"given":"Iain","family":"Beaton","sequence":"first","affiliation":[]},{"given":"Jason I.","family":"Brown","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,9]]},"reference":[{"key":"2487_CR1","doi-asserted-by":"crossref","unstructured":"Alikhani, S.: Dominating Sets and Domination Polynomials of Graphs, 1st edn. Lambert Academic Publishing (2012)","DOI":"10.1155\/2009\/542040"},{"issue":"1","key":"2487_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.7508\/ijmsi.2017.01.006","volume":"12","author":"S Alikhani","year":"2014","unstructured":"Alikhani, S., Jahari, S.: Some families of graphs whose domination polynomials are unimodal. Iran. J. Math. Sci. Inf. 12(1), 69\u201380 (2014). https:\/\/doi.org\/10.7508\/ijmsi.2017.01.006. arXiv:1401.1159","journal-title":"Iran. J. Math. Sci. Inf."},{"key":"2487_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.7494\/OpMath.2010.30.1.37","volume":"30","author":"S Alikhani","year":"2010","unstructured":"Alikhani, S., Peng, Y.H.: Dominating sets and domination polynomials of certain graphs. II. Opuscula Math. 30, 37\u201351 (2010). https:\/\/doi.org\/10.7494\/OpMath.2010.30.1.37","journal-title":"Opuscula Math."},{"key":"2487_CR4","first-page":"257","volume":"114","author":"S Alikhani","year":"2014","unstructured":"Alikhani, S., Peng, Y.H.: Introduction to domination polynomial of a graph. Ars Comb. 114, 257\u2013266 (2014)","journal-title":"Ars Comb."},{"issue":"12","key":"2487_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2021.112595","volume":"344","author":"I Beaton","year":"2021","unstructured":"Beaton, I., Brown, J.I.: The Average Order of Dominating Sets of a Graph. Disc. Math. 344(12), 1\u201314 (2021)","journal-title":"Disc. Math."},{"key":"2487_CR6","doi-asserted-by":"publisher","unstructured":"Chudnovsky, M., Seymour, P.: The roots of the independence polynomial of a clawfree graph. J. Comb. Theory Ser. B 97, 350\u2013357 (2007). https:\/\/doi.org\/10.1016\/j.jctb.2006.06.001","DOI":"10.1016\/j.jctb.2006.06.001"},{"issue":"3","key":"2487_CR7","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1214\/aoms\/1177703287","volume":"35","author":"JN Darroch","year":"1964","unstructured":"Darroch, J.N.: On the distribution of the number of successes in independent trials. Ann. Math. Stat. 35(3), 1317\u20131321 (1964)","journal-title":"Ann. Math. Stat."},{"key":"2487_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BF01844162","volume":"4","author":"R Frucht","year":"1970","unstructured":"Frucht, R., Harary, F.: On the corona of two graphs. Aequationes Math. 4, 322\u2013324 (1970)","journal-title":"Aequationes Math."},{"key":"2487_CR9","doi-asserted-by":"crossref","unstructured":"Hamidoune, Y.O.: On the numbers of independent k-Sets in a Claw Free Graph. J. Comb. Theory Ser. B 50, 241\u2013244 (1990)","DOI":"10.1016\/0095-8956(90)90079-F"},{"key":"2487_CR10","doi-asserted-by":"crossref","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"issue":"3","key":"2487_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF01877590","volume":"25","author":"O Heilmann","year":"1972","unstructured":"Heilmann, O., Lieb, E.: Theory of monomer-dimer systems. Commun. Math. Phys. 25(3), 190\u2013232 (1972)","journal-title":"Commun. Math. Phys."},{"key":"2487_CR12","doi-asserted-by":"publisher","unstructured":"Horrocks, D.G.C.: The numbers of dependent k-sets in a graph are log concave. J. Comb. Theory Ser. B 84, 180\u2013185 (2002). https:\/\/doi.org\/10.1006\/jctb.2001.2077","DOI":"10.1006\/jctb.2001.2077"},{"key":"2487_CR13","first-page":"1","volume":"19","author":"T Kotek","year":"2012","unstructured":"Kotek, T., Preen, J., Simon, F., Tittmann, P., Trinks, M.: Recurrence relations and splitting formulas for the domination polynomial. Electron. J. Comb. 19, 1\u201327 (2012)","journal-title":"Electron. J. Comb."},{"key":"2487_CR14","doi-asserted-by":"crossref","unstructured":"Krattenthaler, C.: Note combinatorial proof of the log-concavity of the sequence of matching numbers. J. Comb. Theory Ser. A 74, 351\u2013354 (1996)","DOI":"10.1006\/jcta.1996.0058"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02487-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:46:09Z","timestamp":1654814769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02487-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2487"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02487-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"5 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors acknowledge there are no conflicts of interest nor competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"90"}}