{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:07:48Z","timestamp":1773702468407,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,8,7]],"date-time":"2012-08-07T00:00:00Z","timestamp":1344297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1211-x","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T07:03:55Z","timestamp":1344236635000},"page":"1175-1181","source":"Crossref","is-referenced-by-count":10,"title":["The Domination Polynomial of a Graph at \u22121"],"prefix":"10.1007","volume":"29","author":[{"given":"Saeid","family":"Alikhani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,7]]},"reference":[{"key":"1211_CR1","doi-asserted-by":"crossref","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 polynomial. Europ. J. Combinatorics. 31, 1714\u20131724 (2010)","journal-title":"Europ. J. Combinatorics."},{"key":"1211_CR2","unstructured":"Akbari, S., Oboudi, M.R.: Cycles are determined by their domination polynomials. Ars. Combin. (in press). Available at http:\/\/arxiv.org\/abs\/0908.3305"},{"key":"1211_CR3","unstructured":"Alikhani, S., Peng, Y.H.: Introduction to domination polynomial of a graph. Ars Combin (in press). Available at http:\/\/arxiv.org\/abs\/0905.2251"},{"issue":"1\u20132","key":"1211_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s12190-010-0389-4","volume":"36","author":"S. Alikhani","year":"2011","unstructured":"Alikhani S., Peng Y.H.: Independence roots and independence fractals of certain graphs. J. Appl. Math. Comput. 36(1\u20132), 89\u2013100 (2011)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"1211_CR5","doi-asserted-by":"crossref","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 Mathematica. 30(1), 37\u201351 (2010)","journal-title":"II Opuscula Mathematica."},{"key":"1211_CR6","doi-asserted-by":"crossref","unstructured":"Alikhani, S., Peng, Y.H.: Dominating sets and domination polynomials of paths. Int. J. Math. Math. Sci. 2009(2009), Article ID 54204","DOI":"10.1155\/2009\/542040"},{"key":"1211_CR7","first-page":"355","volume":"35","author":"S. Alikhani","year":"2011","unstructured":"Alikhani S., Peng Y.H.: Domination polynomials of cubic graphs of order 10. Turk. J. Math. 35, 355\u2013366 (2011)","journal-title":"Turk. J. Math."},{"key":"1211_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.7151\/dmgt.1106","volume":"20","author":"J.L. Arocha","year":"2000","unstructured":"Arocha J.L., Llano B.: Mean value for the matching and dominating polynomial. Discuss. Math. Graph Theory. 20, 57\u201369 (2000)","journal-title":"Discuss. Math. Graph Theory."},{"key":"1211_CR9","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1006\/eujc.2002.0602","volume":"23","author":"P.N. Balister","year":"2002","unstructured":"Balister P.N., Bollob\u00e1s B., Cutler J., Pebody L.: The interlace polynomial of graphs at \u22121. Europ. J. Combinatorics. 23, 761\u2013767 (2002)","journal-title":"Europ. J. Combinatorics."},{"key":"1211_CR10","unstructured":"Brouwer, A.E.: The number of dominating sets of a finite graph is odd (preprint)"},{"key":"1211_CR11","doi-asserted-by":"crossref","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":"1211_CR12","unstructured":"Levit, V.E., Mandrescu, E.: The independence polynomial of a graph at \u22121. Availabe at http:\/\/arxiv.org\/abs\/0904.4819v1"},{"key":"1211_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","volume":"5","author":"R.P. Stanley","year":"1973","unstructured":"Stanley R.P.: Acyclic orientations of graphs. Dis. Math. 5, 171\u2013178 (1973)","journal-title":"Dis. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1211-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1211-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1211-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1211-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,7]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1211"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1211-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,7]]}}}