{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:53Z","timestamp":1759063493156},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T00:00:00Z","timestamp":1495670400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1792-5","type":"journal-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T05:21:07Z","timestamp":1495689667000},"page":"665-672","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Structure of Dominating Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Saeid","family":"Alikhani","sequence":"first","affiliation":[]},{"given":"Davood","family":"Fatehi","sequence":"additional","affiliation":[]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"1792_CR1","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1007\/s00373-012-1211-x","volume":"29","author":"S Alikhani","year":"2013","unstructured":"Alikhani, S.: The domination polynomial of a graph at \n                        $$-1$$\n                        \n                            \n                                            \n                                \n                                    -\n                                    1\n                                \n                            \n                        \n                    . Graphs Combin. 29, 1175\u20131181 (2013)","journal-title":"Graphs Combin."},{"key":"1792_CR2","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 Math. 30, 37\u201351 (2010)","journal-title":"Opuscula Math."},{"key":"1792_CR3","first-page":"257","volume":"114","author":"S Alikhani","year":"2014","unstructured":"Alikhani, S., Peng, Y.H.: Introduction to domination polynomial of a graph. Ars Combin. 114, 257\u2013266 (2014)","journal-title":"Ars Combin."},{"key":"1792_CR4","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1007\/s00373-014-1521-2","volume":"31","author":"BM Anthony","year":"2015","unstructured":"Anthony, B.M., Picollelli, M.E.: Complete \n                        $$r$$\n                        \n                            \n                                            \n                                r\n                            \n                        \n                    -partite graphs determined by their domination polynomial. Graphs Combin. 31, 1993\u20132002 (2015)","journal-title":"Graphs Combin."},{"key":"1792_CR5","first-page":"3","volume":"10","author":"MM Blank","year":"1973","unstructured":"Blank, M.M.: An estimate of the external stability number of a graph without suspended vertices (in Russian). Prikl. Mat. i Progr. 10, 3\u201311 (1973)","journal-title":"Prikl. Mat. i Progr."},{"key":"1792_CR6","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"B Bre\u0161ar","year":"2010","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Domination game and an imagination strategy. SIAM J. Discrete Math. 24, 979\u2013991 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1792_CR7","unstructured":"Brouwer, A.E., Csorba, P., Schrijver, A.: The number of dominating sets of a finite graph is odd (preprint) (2009). \n                        http:\/\/www.win.tue.nl\/~aeb\/preprints\/domin4a.pdf"},{"key":"1792_CR8","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs.: Domination game on forests. Discrete Math. 338, 2220\u20132228 (2015)","DOI":"10.1016\/j.disc.2015.05.022"},{"key":"1792_CR9","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00373-015-1585-7","volume":"32","author":"Cs Bujt\u00e1s","year":"2016","unstructured":"Bujt\u00e1s, Cs, Klav\u017ear, S.: Improved upper bounds on the domination number of graphs with minimum degree at least five. Graphs Combin. 32, 511\u2013519 (2016)","journal-title":"Graphs Combin."},{"key":"1792_CR10","doi-asserted-by":"crossref","first-page":"517","DOI":"10.7151\/dmgt.1562","volume":"31","author":"G Fricke","year":"2011","unstructured":"Fricke, G., Hedetniemi, S.M., Hedetniemi, S.T., Hutson, K.R.: \n                        $$\\gamma $$\n                        \n                            \n                                            \n                                \u03b3\n                            \n                        \n                    -graphs of graphs. Discuss. Math. Graph Theory 31, 517\u2013531 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1792_CR11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s00373-013-1302-3","volume":"30","author":"R Haas","year":"2014","unstructured":"Haas, R., Seyffarth, K.: The \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -dominating graph. Graphs Combin. 30, 609\u2013617 (2014)","journal-title":"Graphs Combin."},{"key":"1792_CR12","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-319-21840-3_33","volume":"9214","author":"A Haddadan","year":"2015","unstructured":"Haddadan, A., Ito, T., Mouawad, A.E., Nishimura, N., Ono, H., Suzuki, A., Tebbal, Y.: The complexity of dominating set reconfiguration. Lect. Notes Comput. Sci. 9214, 398\u2013409 (2015)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1792_CR13","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":"1792_CR14","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W McCuaig","year":"1989","unstructured":"McCuaig, W., Shepherd, B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749\u2013762 (1989)","journal-title":"J. Graph Theory"},{"key":"1792_CR15","volume-title":"Theory of Graphs","author":"O Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society, Providence (1962)"},{"key":"1792_CR16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B Reed","year":"1996","unstructured":"Reed, B.: Paths, stars and the number three. Combin. Probab. Comput. 5, 277\u2013295 (1996)","journal-title":"Combin. Probab. Comput."},{"key":"1792_CR17","doi-asserted-by":"crossref","first-page":"759","DOI":"10.4134\/JKMS.2009.46.4.759","volume":"46","author":"MY Sohn","year":"2009","unstructured":"Sohn, M.Y., Xudong, Y.: Domination in graphs of minimum degree four. J. Korean Math. Soc. 46, 759\u2013773 (2009)","journal-title":"J. Korean Math. Soc."},{"key":"1792_CR18","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1007\/s10878-015-9947-x","volume":"32","author":"A Suzuki","year":"2016","unstructured":"Suzuki, A., Mouawad, A.E., Nishimura, N.: Reconfiguration of dominating sets. J. Combin. Optim. 32, 1182\u20131195 (2016)","journal-title":"J. Combin. Optim."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1792-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1792-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1792-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T18:43:46Z","timestamp":1498157026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1792-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,25]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1792"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1792-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,25]]}}}