{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:49:13Z","timestamp":1773798553519,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"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":[[2009,11]]},"DOI":"10.1007\/s00373-009-0864-6","type":"journal-article","created":{"date-parts":[[2009,12,11]],"date-time":"2009-12-11T09:35:40Z","timestamp":1260524140000},"page":"513-520","source":"Crossref","is-referenced-by-count":11,"title":["Upper Bounds for \u03b1-Domination Parameters"],"prefix":"10.1007","volume":"25","author":[{"given":"Andrei","family":"Gagarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anush","family":"Poghosyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim","family":"Zverovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"864_CR1","unstructured":"Alber, J., Betzler, N., Niedermeier, R.: Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. 146, 105\u2013117 (2006)"},{"key":"864_CR2","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. New York: Wiley, 1992"},{"key":"864_CR3","unstructured":"Arnautov, V.I.: Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices. (Russian) Prikl. Mat. i Programmirovanie 11, 3\u20138 (1974)"},{"key":"864_CR4","unstructured":"Caro, Y., Yuster, R.: Dominating a family of graphs with small connected subgraphs. Comb. Probab. Comput. 9, 309\u2013313 (2000)"},{"key":"864_CR5","doi-asserted-by":"crossref","unstructured":"Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2, 275\u2013300 (2005)","DOI":"10.1080\/15427951.2005.10129105"},{"key":"864_CR6","doi-asserted-by":"crossref","unstructured":"Dahme, F., Rautenbach, D., Volkmann, L.: \u03b1-Domination perfect trees. Discrete Math. 308, 3187\u20133198 (2008)","DOI":"10.1016\/j.disc.2007.06.043"},{"key":"864_CR7","unstructured":"Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distrib. Comput. 66, 947\u2013958 (2006)"},{"key":"864_CR8","doi-asserted-by":"crossref","unstructured":"Dunbar, J.E., Hoffman, D.G., Laskar, R.C., Markus, L.R.: \u03b1-Domination. Discrete Math. 211, 11\u201326 (2000)","DOI":"10.1016\/S0012-365X(99)00131-4"},{"key":"864_CR9","unstructured":"Favaron, O.: On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. Comb. Theory, Ser. B 39, 101\u2013102 (1985)"},{"key":"864_CR10","doi-asserted-by":"crossref","unstructured":"Favaron, O., Hansberg, A., Volkmann, L.: On k-domination and minimum degree in graphs. J. Graph Theory 57, 33\u201340 (2008)","DOI":"10.1002\/jgt.20279"},{"key":"864_CR11","doi-asserted-by":"crossref","unstructured":"Gagarin, A., Zverovich, V.E.: A generalized upper bound for the k-tuple domination number. Discrete Math. 308, 880\u2013885 (2008)","DOI":"10.1016\/j.disc.2007.07.033"},{"key":"864_CR12","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. New York: Marcel Dekker, 1998"},{"key":"864_CR13","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89, 75\u201383 (2004)"},{"key":"864_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"864_CR15","unstructured":"Payan, C.: Sur le nombre d\u2019absorption d\u2019un graphe simple. (French) Cah. Cent. \u00c9tud. Rech. Op\u00e9r. 17, 307\u2013317 (1975)"},{"key":"864_CR16","unstructured":"Zverovich, V.E.: The k-tuple domination number revisited. Appl. Math. Lett. 21, 1005\u20131011 (2008)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0864-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0864-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0864-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0864-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["864"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0864-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}