{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:49:31Z","timestamp":1773798571240,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,23]],"date-time":"2017-12-23T00:00:00Z","timestamp":1513987200000},"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":[[2018,1]]},"DOI":"10.1007\/s00373-017-1869-1","type":"journal-article","created":{"date-parts":[[2017,12,23]],"date-time":"2017-12-23T05:12:56Z","timestamp":1514005976000},"page":"193-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On \n                $$\\alpha $$\n                \n                    \n                        \u03b1\n                    \n                \n            -Domination in Graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7647-4454","authenticated-orcid":false,"given":"Angsuman","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renu C.","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nader Jafari","family":"Rad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,23]]},"reference":[{"key":"1869_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The probabilistic method. In: Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000)","DOI":"10.1002\/0471722154"},{"key":"1869_CR2","unstructured":"Caro, Y.: New results on the independence number. In: Technical Report, Tel-Aviv University (1979)"},{"key":"1869_CR3","doi-asserted-by":"crossref","first-page":"3187","DOI":"10.1016\/j.disc.2007.06.043","volume":"308","author":"F Dahme","year":"2008","unstructured":"Dahme, F., Rautenbach, D., Volkmann, L.: \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -Domination perfect trees. Discrete Appl. Math. 308, 3187\u20133198 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1869_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.7151\/dmgt.1241","volume":"24","author":"F Dahme","year":"2004","unstructured":"Dahme, F., Rautenbach, D., Volkmann, L.: Some remarks on \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -domination. Discuss. Math. Graph Theory 24, 423\u2013430 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1869_CR5","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer, P.A., Roberts, F.S.: Irreversible \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl. Math. 157, 1615\u20131627 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1869_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0012-365X(99)00131-4","volume":"211","author":"JE Dunbar","year":"2000","unstructured":"Dunbar, J.E., Hoffman, D.G., Laskar, R.C., Markus, L.R.: \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -Domination. Discrete Math. 211, 11\u201326 (2000)","journal-title":"Discrete Math."},{"issue":"4","key":"1869_CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00373-009-0864-6","volume":"25","author":"A Gagarin","year":"2009","unstructured":"Gagarin, A., Poghosyan, A., Zverovich, V.E.: Upper bounds for alpha-domination parameters. Graphs Comb. 25(4), 513\u2013520 (2009)","journal-title":"Graphs Comb."},{"key":"1869_CR8","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 Inc., New York (1998)"},{"key":"1869_CR9","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds): Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"1869_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs. Theor. Comput. Sci. 282, 231\u2013257 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"1869_CR11","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1007\/s00373-015-1614-6","volume":"32","author":"NJ Rad","year":"2016","unstructured":"Rad, N.J., Volkmann, L.: Edge-removal and edge-addition in \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -domination. Graphs Comb. 32, 1155\u20131166 (2016)","journal-title":"Graphs Comb."},{"issue":"6","key":"1869_CR12","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.2298\/FIL1206257R","volume":"36","author":"NJ Rad","year":"2012","unstructured":"Rad, N.J., Volkmann, L.: Vertex-removal in \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -domination. Filomat 36(6), 1257\u20131262 (2012)","journal-title":"Filomat"},{"key":"1869_CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.7151\/dmgt.1295","volume":"25","author":"Z Tuza","year":"2005","unstructured":"Tuza, Z.: Highly connected counterexamples to a conjecture on \n                        $$\\alpha $$\n                        \n                            \n                                \u03b1\n                            \n                        \n                    -domination. Discuss. Math. Graph Theory 25, 435\u2013440 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1869_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(94)90110-4","volume":"51","author":"L Volkmann","year":"1994","unstructured":"Volkmann, L.: On graphs with equal domination and covering numbers. Discrete Appl. Math. 51, 211\u2013217 (1994)","journal-title":"Discrete Appl. Math."},{"key":"1869_CR15","unstructured":"Wei, V.K.: A lower bound on the stability number of a simple graph. In: Bell Laboratories Technical Memorandum 81-11217-9, Murray Hill (1981)"},{"key":"1869_CR16","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, London (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1869-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1869-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1869-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T12:07:55Z","timestamp":1517832475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1869-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,23]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1869"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1869-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,23]]}}}