{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:26:15Z","timestamp":1774466775580,"version":"3.50.1"},"reference-count":157,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T00:00:00Z","timestamp":1302220800000},"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":[[2012,1]]},"DOI":"10.1007\/s00373-011-1040-3","type":"journal-article","created":{"date-parts":[[2011,4,7]],"date-time":"2011-04-07T20:22:43Z","timestamp":1302207763000},"page":"1-55","source":"Crossref","is-referenced-by-count":92,"title":["k-Domination and k-Independence in Graphs: A Survey"],"prefix":"10.1007","volume":"28","author":[{"given":"Mustapha","family":"Chellali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Odile","family":"Favaron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"Hansberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,8]]},"reference":[{"key":"1040_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"R.B. Allan","year":"1978","unstructured":"Allan R.B., Laskar R.: On domination and independent domination numbers of a graph. Discrete Math. 23, 73\u201376 (1978)","journal-title":"Discrete Math."},{"key":"1040_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N. Alon","year":"1990","unstructured":"Alon N.: Transversal numbers of uniform hypergraphs. Graphs Combin. 6, 1\u20134 (1990)","journal-title":"Graphs Combin."},{"key":"1040_CR3","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. In: Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn. Wiley-Interscience, New York (2000, with an appendix on the life and work of Paul Erd\u0151s)"},{"key":"1040_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ipl.2007.05.010","volume":"104","author":"T. Araki","year":"2007","unstructured":"Araki T.: On the k-tuple domination of de Bruijn and Kautz digraphs. Inform. Process. Lett. 104, 86\u201390 (2007)","journal-title":"Inform. Process. Lett."},{"key":"1040_CR5","first-page":"3","volume":"11","author":"V.I. Arnautov","year":"1974","unstructured":"Arnautov V.I.: Estimation of the exterior stability number of a graph by means of the minimal degree of vertices. Prikl. Mat. i Programmirovanie 11, 3\u20138 (1974) (in Russian)","journal-title":"Prikl. Mat. i Programmirovanie"},{"key":"1040_CR6","first-page":"169","volume":"5","author":"M. Atapour","year":"2008","unstructured":"Atapour M., Sheikholeslami S.M., Hansberg A., Volkmann L., Khodkar A.: 2-domination subdivision number of graphs. AKCE J. Graphs Combin. 5, 169\u2013177 (2008)","journal-title":"AKCE J. Graphs Combin."},{"key":"1040_CR7","first-page":"101","volume":"21","author":"D.W. Bange","year":"1978","unstructured":"Bange D.W., Barkauskas A.E., Slater P.J.: A constructive characterization of trees with two disjoint minimum dominating sets. Congr. Numer. 21, 101\u2013112 (1978)","journal-title":"Congr. Numer."},{"key":"1040_CR8","first-page":"29","volume":"10","author":"T.J. Bean","year":"1994","unstructured":"Bean T.J., Henning M.A., Swart H.C.: On the integrity of distance domination in graphs. Australas. J. Combin. 10, 29\u201343 (1994)","journal-title":"Australas. J. Combin."},{"key":"1040_CR9","first-page":"123","volume":"9","author":"C. Berge","year":"1960","unstructured":"Berge C.: Les probl\u00e8mes de coloration en th\u00e9orie des graphes. Publ. Inst. Stat. Univ. Paris 9, 123\u2013160 (1960)","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"key":"1040_CR10","unstructured":"Blidia, M., Bouchou, A., Volkmann, L.: Bounds on the k-independence and k-chromatic numbers of graphs. Ars Combin (in press)"},{"key":"1040_CR11","first-page":"317","volume":"33","author":"M. Blidia","year":"2005","unstructured":"Blidia M., Chellali M., Favaron O.: Independence and 2-domination in trees. Australas. J. Combin. 33, 317\u2013327 (2005)","journal-title":"Australas. J. Combin."},{"key":"1040_CR12","doi-asserted-by":"crossref","unstructured":"Blidia, M., Chellali, M., Favaron, O.: Ratios of some domination parameters in graphs and claw-free graphs. In: Graph Theory, Trends in Mathematics, pp. 61\u201372. Birkh\u00e4user, Basel (2006)","DOI":"10.1007\/978-3-7643-7400-6_6"},{"key":"1040_CR13","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.disc.2006.11.007","volume":"307","author":"M. Blidia","year":"2007","unstructured":"Blidia M., Chellali M., Favaron O., Meddah N.: On k-independence in graphs with emphasis on trees. Discrete Math. 307, 2209\u20132216 (2007)","journal-title":"Discrete Math."},{"key":"1040_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.7151\/dmgt.1398","volume":"28","author":"M. Blidia","year":"2008","unstructured":"Blidia M., Chellali M., Favaron O., Meddah N.: Maximal k-independent sets in graphs. Discuss. Math. Graph Theory 28, 151\u2013163 (2008)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR15","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1016\/j.disc.2006.03.061","volume":"306","author":"M. Blidia","year":"2006","unstructured":"Blidia M., Chellali M., Haynes T.W.: Characterizations of trees with equal paired and double domination numbers. Discrete Math. 306, 1840\u20131845 (2006)","journal-title":"Discrete Math."},{"key":"1040_CR16","first-page":"159","volume":"70","author":"M. Blidia","year":"2006","unstructured":"Blidia M., Chellali M., Haynes T.W., Henning M.A.: Independent and double domination in trees. Util. Math. 70, 159\u2013173 (2006)","journal-title":"Util. Math."},{"key":"1040_CR17","doi-asserted-by":"crossref","first-page":"355","DOI":"10.7151\/dmgt.1288","volume":"25","author":"M. Blidia","year":"2005","unstructured":"Blidia M., Chellali M., Volkmann L.: On the p-domination number of cactus graphs. Discuss. Math. Graph Theory 25, 355\u2013361 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR18","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1016\/j.disc.2006.04.010","volume":"306","author":"M. Blidia","year":"2006","unstructured":"Blidia M., Chellali M., Volkmann L.: Some bounds on the p-domination number in trees. Discrete Math. 306, 2031\u20132037 (2006)","journal-title":"Discrete Math."},{"key":"1040_CR19","first-page":"209","volume":"71","author":"M. Blidia","year":"2006","unstructured":"Blidia M., Chellali M., Volkmann L.: Bounds of the 2-domination number of graphs. Util. Math. 71, 209\u2013216 (2006)","journal-title":"Util. Math."},{"key":"1040_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1093\/qmath\/41.3.269","volume":"41","author":"R.C. Brigham","year":"1990","unstructured":"Brigham R.C., Dutton R.D.: Bounds on the domination number of a graph. Q. J. Math. Oxf. Ser. (2) 41, 269\u2013275 (1990)","journal-title":"Q. J. Math. Oxf. Ser. (2)"},{"key":"1040_CR21","first-page":"49","volume":"29C","author":"Y. Caro","year":"1990","unstructured":"Caro Y.: On the k-domination and k-transveral numbers of graphs and hypergraphs. Ars Combin. 29C, 49\u201355 (1990)","journal-title":"Ars Combin."},{"key":"1040_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1155\/S016117129000031X","volume":"13","author":"Y. Caro","year":"1990","unstructured":"Caro Y., Roditty Y.: A note on the k-domination number of a graph. Int. J. Math. Math. Sci. 13, 205\u2013206 (1990)","journal-title":"Int. J. Math. Math. Sci."},{"key":"1040_CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190150110","volume":"15","author":"Y. Caro","year":"1991","unstructured":"Caro Y., Tuza Z.: Improved lower bounds on k-independence. J. Graph Theory 15, 99\u2013107 (1991)","journal-title":"J. Graph Theory"},{"key":"1040_CR24","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"Y. Caro","year":"2000","unstructured":"Caro Y., West D., Yuster R.: Connected domination and spanning trees with many leaves. SIAM J. Discrete Math. 13, 202\u2013211 (2000) (electronic)","journal-title":"SIAM J. Discrete Math."},{"key":"1040_CR25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1017\/S0963548300004260","volume":"9","author":"Y. Caro","year":"2000","unstructured":"Caro Y., Yuster R.: Dominating a family of graphs with small connected subgraphs. Combin. Probab. Comput. 9, 309\u2013313 (2000)","journal-title":"Combin. Probab. Comput."},{"key":"1040_CR26","first-page":"175","volume":"48","author":"B. Chaluvaraju","year":"2010","unstructured":"Chaluvaraju B., Chellali M., Vidya K.A.: Perfect k-domination in graphs. Australas. J. Combin. 48, 175\u2013184 (2010)","journal-title":"Australas. J. Combin."},{"key":"1040_CR27","unstructured":"Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for Roman domination (2007, unpublished manuscript)"},{"key":"1040_CR28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.2164-0947.1974.tb01571.x","volume":"36","author":"G. Chartrand","year":"1974","unstructured":"Chartrand G., Schuster S.: On the independence numbers of complementary graphs. Trans. New York Acad. Sci. Ser. II 36, 247\u2013251 (1974)","journal-title":"Trans. New York Acad. Sci. Ser. II"},{"key":"1040_CR29","first-page":"147","volume":"3","author":"M. Chellali","year":"2006","unstructured":"Chellali M.: A note on the double domination number in trees. AKCE Int. J. Graphs Comb. 3, 147\u2013150 (2006)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"1040_CR30","first-page":"5","volume":"26","author":"M. Chellali","year":"2006","unstructured":"Chellali M.: Bounds on the 2-domination number in cactus graphs. Opuscula Math. 26, 5\u201312 (2006)","journal-title":"Opuscula Math."},{"key":"1040_CR31","unstructured":"Chellali, M.: k-Domination stable graphs upon edge removal. Ars Combin. (in press)"},{"key":"1040_CR32","first-page":"205","volume":"68","author":"M. Chellali","year":"2009","unstructured":"Chellali M., Favaron O.: On k-star forming sets in graphs. J. Combin. Math. Combin. Comput. 68, 205\u2013214 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR33","first-page":"65","volume":"73","author":"M. Chellali","year":"2010","unstructured":"Chellali M., Favaron O., Hansberg A., Volkmann L.: On the p-domination, the total domination and the connected domination numbers of graphs. J. Combin. Math. Combin. Comput. 73, 65\u201375 (2010)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR34","doi-asserted-by":"crossref","first-page":"3879","DOI":"10.1016\/j.disc.2007.07.087","volume":"308","author":"M. Chellali","year":"2008","unstructured":"Chellali M., Favaron O., Haynes T.W., Raber D.: Ratios of some domination parameters in trees. Discrete Math. 308, 3879\u20133887 (2008)","journal-title":"Discrete Math."},{"key":"1040_CR35","first-page":"161","volume":"67","author":"M. Chellali","year":"2005","unstructured":"Chellali M., Haynes T.W.: On paired and double domination in graphs. Util. Math. 67, 161\u2013171 (2005)","journal-title":"Util. Math."},{"key":"1040_CR36","first-page":"233","volume":"83","author":"M. Chellali","year":"2010","unstructured":"Chellali M., Haynes T.W.: A characterization of trees with unique minimum double dominating sets. Util. Math. 83, 233\u2013242 (2010)","journal-title":"Util. Math."},{"key":"1040_CR37","doi-asserted-by":"crossref","first-page":"265","DOI":"10.7151\/dmgt.1492","volume":"30","author":"M. Chellali","year":"2010","unstructured":"Chellali M., Haynes T.W., Volkmann L.: k-Independence stable graphs upon edge removal. Discuss. Math. Graph Theory 30, 265\u2013274 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR38","doi-asserted-by":"crossref","first-page":"291","DOI":"10.7151\/dmgt.1282","volume":"25","author":"M. Chellali","year":"2005","unstructured":"Chellali M., Khelladi A., Maffray F.: Exact double domination in graphs. Discuss. Math. Graph Theory 25, 291\u2013302 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR39","unstructured":"Chellali, M., Volkmann, L.: Characterization of trees with equal 2-domination number and domination number plus two. Discuss. Math. Graph Theory (in press)"},{"key":"1040_CR40","first-page":"139","volume":"39","author":"G. Chen","year":"2001","unstructured":"Chen G., Jacobson M.S.: On a relationship between 2-dominating and 5-dominating sets in graphs. J. Combin. Math. Combin. Comput. 39, 139\u2013145 (2001)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR41","first-page":"451","volume":"25","author":"X. Chen","year":"2005","unstructured":"Chen X., Sun L.: Some new results on double domination in graphs. J. Math. Res. Expo. 25, 451\u2013456 (2005)","journal-title":"J. Math. Res. Expo."},{"key":"1040_CR42","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(97)00204-5","volume":"185","author":"B. Chen","year":"1998","unstructured":"Chen B., Zhou S.: Upper bounds for f-domination number of graphs. Discrete Math. 185, 239\u2013243 (1998)","journal-title":"Discrete Math."},{"key":"1040_CR43","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"E.J. Cockayne","year":"2004","unstructured":"Cockayne E.J., Dreyer J.P.A., Hedetniemi S.M., Hedetniemi S.T.: Roman domination in graphs. Discrete Math. 278, 11\u201322 (2004)","journal-title":"Discrete Math."},{"key":"1040_CR44","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","volume":"33","author":"E.J. Cockayne","year":"1981","unstructured":"Cockayne E.J., Favaron O., Payan C., Thomason A.G.: Contribution to the theory of domination, independence and irredundance in graphs. Discrete Math. 33, 249\u2013258 (1981)","journal-title":"Discrete Math."},{"key":"1040_CR45","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/jgt.3190090414","volume":"9","author":"E.J. Cockayne","year":"1985","unstructured":"Cockayne E.J., Gamble B., Shepherd B.: An upper bound for the k-domination number of a graph. J. Graph Theory 9, 533\u2013534 (1985)","journal-title":"J. Graph Theory"},{"key":"1040_CR46","first-page":"19","volume":"67","author":"E.J. Cockayne","year":"2005","unstructured":"Cockayne E.J., Grobler P.J.P., Gr\u00fcndlingh W.R., Munganga J., van Vuuren J.H.: Protection of a graph. Util. Math. 67, 19\u201332 (2005)","journal-title":"Util. Math."},{"key":"1040_CR47","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E.J. Cockayne","year":"1977","unstructured":"Cockayne E.J., Hedetniemi S.T.: Towards a theory of domination in graphs. Networks 7, 247\u2013261 (1977)","journal-title":"Networks"},{"key":"1040_CR48","first-page":"251","volume":"64","author":"E.J. Cockayne","year":"2008","unstructured":"Cockayne E.J., Thomason A.G.: An upper bound for the k-tuple domination number. J. Combin. Math. Combin. Comput. 64, 251\u2013254 (2008)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR49","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(83)90091-1","volume":"17","author":"C. Croitoru","year":"1983","unstructured":"Croitoru C., Suditu E.: Perfect stables in graphs. Inform. Process. Lett. 17, 53\u201356 (1983)","journal-title":"Inform. Process. Lett."},{"key":"1040_CR50","doi-asserted-by":"crossref","unstructured":"DeLaVi\u00f1a, E., Goddard, W., Henning, M.A., Pepper, R., Vaughan, E.R.: Bounds on the k-domination number of a graph. Appl. Math. Lett. (2011). doi: 10.1016\/j.aml.2011.01.013","DOI":"10.1016\/j.aml.2011.01.013"},{"key":"1040_CR51","first-page":"259","volume":"62","author":"G.S. Domke","year":"1988","unstructured":"Domke G.S., Hedetniemi S.T., Laskar R., Allan R.: Generalized packings and coverings of graphs. Congr. Numer. 62, 259\u2013270 (1988)","journal-title":"Congr. Numer."},{"key":"1040_CR52","doi-asserted-by":"crossref","first-page":"103","DOI":"10.7151\/dmgt.1305","volume":"26","author":"P. Dorbec","year":"2006","unstructured":"Dorbec P., Gravier S., Klav\u017ear S., \u0160pacapan S.: Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26, 103\u2013112 (2006)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR53","doi-asserted-by":"crossref","unstructured":"Duchet, P., Meyniel, H.: On Hadwiger\u2019s number and the stability number, Graph theory (Cambridge, 1981), North-Holland Math. Stud., vol. 62, North-Holland, Amsterdam, 71\u201373 (1982)","DOI":"10.1016\/S0304-0208(08)73549-7"},{"key":"1040_CR54","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0166-218X(03)00200-2","volume":"136","author":"S. Erfang","year":"2004","unstructured":"Erfang S., Chuangyin D., Liying K.: A note on Nordhaus-Gaddum inequalities for domination. Discrete Appl. Math. 136, 83\u201385 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR55","first-page":"23","volume":"66","author":"S. Fajtlowicz","year":"1988","unstructured":"Fajtlowicz S.: On conjectures of Graffiti. III. Congr. Numer. 66, 23\u201332 (1988)","journal-title":"Congr. Numer."},{"key":"1040_CR56","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0095-8956(85)90040-1","volume":"39","author":"O. Favaron","year":"1985","unstructured":"Favaron O.: On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. Combin. Theory Ser. B 39, 101\u2013102 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1040_CR57","first-page":"159","volume":"25C","author":"O. Favaron","year":"1988","unstructured":"Favaron O.: k-domination and k-independence in graphs. Ars Combin. 25C, 159\u2013167 (1988)","journal-title":"Ars Combin."},{"key":"1040_CR58","first-page":"33","volume":"2","author":"O. Favaron","year":"2005","unstructured":"Favaron O.: An alternative definition of the k-irredundance. AKCE Int. J. Graphs Comb. 2, 33\u201338 (2005)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"1040_CR59","unstructured":"Favaron, O.: Bounds on the upper k-domination number and the upper k-star-forming number of a graph. J. Combin. Math. Combin. Comput. (in press)"},{"key":"1040_CR60","unstructured":"Favaron, O.: Graduate course in the unversity of Blida (2005, unpublished)"},{"key":"1040_CR61","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/jgt.20279","volume":"57","author":"O. Favaron","year":"2008","unstructured":"Favaron O., Hansberg A., Volkmann L.: On k-domination and minimum degree in graphs. J. Graph Theory 57, 33\u201340 (2008)","journal-title":"J. Graph Theory"},{"key":"1040_CR62","first-page":"199","volume":"6","author":"O. Favaron","year":"1989","unstructured":"Favaron O., Hartnell B.L.: On well-k-covered graphs. J. Combin. Math. Combin. Comput. 6, 199\u2013205 (1989)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR63","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0012-365X(01)00236-9","volume":"249","author":"O. Favaron","year":"2002","unstructured":"Favaron O., Hedetniemi S.M., Hedetniemi S.T., Rall D.F.: On k-dependent domination. Discrete Math. 249, 83\u201394 (2002)","journal-title":"Discrete Math."},{"key":"1040_CR64","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0012-365X(00)00313-7","volume":"231","author":"O. Favaron","year":"2001","unstructured":"Favaron O., Henning M.A., Puech J., Rautenbach D.: On domination and annihilation in graphs with claw-free blocks. Discrete Math. 231, 143\u2013151 (2001)","journal-title":"Discrete Math."},{"key":"1040_CR65","unstructured":"Favaron, O., Kratsch, D.: Ratios of domination parameters. In: Advances in Graph Theory, pp. 173\u2013182. Vishwa, Gulbarga (1991)"},{"key":"1040_CR66","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.3190150107","volume":"15","author":"O. Favaron","year":"1991","unstructured":"Favaron O., Mah\u00e9o M., Sacl\u00e9 J.F.: On the residue of a graph. J. Graph Theory 15, 39\u201364 (1991)","journal-title":"J. Graph Theory"},{"key":"1040_CR67","unstructured":"Fink, J.F., Jacobson, M.S.: n-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 283\u2013300. Wiley, New York (1985)"},{"key":"1040_CR68","unstructured":"Fink, J.F., Jacobson, M.S.: On n-domination, n-dependence and forbidden subgraphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 301\u2013311. Wiley, New York (1985)"},{"key":"1040_CR69","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01848079","volume":"16","author":"J.F. Fink","year":"1985","unstructured":"Fink J.F., Jacobson M.S., Kinch L., Roberts J.: On graphs having domination number half their order. Period. Math. Hungar. 16, 287\u2013293 (1985)","journal-title":"Period. Math. Hungar."},{"key":"1040_CR70","first-page":"223","volume":"67","author":"M. Fischermann","year":"2005","unstructured":"Fischermann M., Volkmann L.: A remark on a conjecture for the (k, p)-domination number. Util. Math. 67, 223\u2013227 (2005)","journal-title":"Util. Math."},{"key":"1040_CR71","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BF01844162","volume":"4","author":"R.W. Frucht","year":"1970","unstructured":"Frucht R.W., Harary F.: On the corona of two graphs. Aequationes Math. 4, 322\u2013325 (1970)","journal-title":"Aequationes Math."},{"key":"1040_CR72","first-page":"265","volume":"40","author":"J. Fujisawa","year":"2008","unstructured":"Fujisawa J., Hansberg A., Kubo T., Saito A., Sugita M., Volkmann L.: Independence and 2-domination in bipartite graphs. Australas. J. Combin. 40, 265\u2013268 (2008)","journal-title":"Australas. J. Combin."},{"key":"1040_CR73","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1016\/j.disc.2007.07.033","volume":"308","author":"A. Gagarin","year":"2008","unstructured":"Gagarin A., Zverovich V.E.: A generalised upper bound for the k-tuple domination number. Discrete Math. 308, 880\u2013885 (2008)","journal-title":"Discrete Math."},{"key":"1040_CR74","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(03)00300-7","volume":"134","author":"E. Grigorescu","year":"2004","unstructured":"Grigorescu E.: The insulation sequence of a graph. Discrete Appl. Math. 134, 77\u201390 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR75","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(93)90026-K","volume":"46","author":"G. Gunther","year":"1993","unstructured":"Gunther G., Hartnell B., Rall D.F.: Graphs whose vertex independence number is unaffected by single edge addition or deletion. Discrete Appl. Math. 46, 167\u2013172 (1993)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR76","unstructured":"Hansberg, A.: On the k-domination number, the domination number and the cycle of length four (submitted)"},{"issue":"14","key":"1040_CR77","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1016\/j.dam.2010.05.021","volume":"158","author":"A. Hansberg","year":"2010","unstructured":"Hansberg A.: Bounds on the connected k-domination number. Discrete Appl. Math. 158(14), 1506\u20131510 (2010)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR78","doi-asserted-by":"crossref","first-page":"2915","DOI":"10.1080\/00207160903137167","volume":"87","author":"A. Hansberg","year":"2010","unstructured":"Hansberg A., Meierling D., Volkmann L.: A general method in the theory of domination in graphs. Int. J. Comput. Math. 87, 2915\u20132924 (2010)","journal-title":"Int. J. Comput. Math."},{"key":"1040_CR79","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1080\/00207160.2010.482664","volume":"88","author":"A. Hansberg","year":"2011","unstructured":"Hansberg A., Meierling D., Volkmann L.: Independence and k-domination in graphs. Int. J. Comput. Math. 88, 905\u2013915 (2011)","journal-title":"Int. J. Comput. Math."},{"key":"1040_CR80","unstructured":"Hansberg, A. Pepper, R.: On k-domination and j-dependence in graphs (submitted)"},{"key":"1040_CR81","unstructured":"Hansberg, A., Randerath, B., Volkmann, L.: Claw-free graphs with equal 2-domination and domination numbers (submitted)"},{"key":"1040_CR82","doi-asserted-by":"crossref","first-page":"93","DOI":"10.7151\/dmgt.1347","volume":"27","author":"A. Hansberg","year":"2007","unstructured":"Hansberg A., Volkmann L.: Characterization of block graphs with equal 2-domination number and domination number plus one. Discuss. Math. Graph Theory 27, 93\u2013103 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR83","first-page":"265","volume":"77","author":"A. Hansberg","year":"2008","unstructured":"Hansberg A., Volkmann L.: Characterization of unicyclic graphs with equal 2-domination number and domination number plus one. Util. Math. 77, 265\u2013276 (2008)","journal-title":"Util. Math."},{"key":"1040_CR84","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1016\/j.disc.2007.04.057","volume":"308","author":"A. Hansberg","year":"2008","unstructured":"Hansberg A., Volkmann L.: On graphs with equal domination and 2-domination numbers. Discrete Math. 308, 2277\u20132281 (2008)","journal-title":"Discrete Math."},{"key":"1040_CR85","first-page":"245","volume":"68","author":"A. Hansberg","year":"2009","unstructured":"Hansberg A., Volkmann L.: Lower bounds on the p-domination number in terms of cycles and matching number. J. Combin. Math. Combin. Comput. 68, 245\u2013255 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR86","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1016\/j.dam.2008.10.011","volume":"157","author":"A. Hansberg","year":"2009","unstructured":"Hansberg A., Volkmann L.: Upper bounds on the k-domination number and the k-Roman domination number. Discrete Appl. Math. 157, 1634\u20131639 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR87","unstructured":"Hansberg, A., Volkmann, L.: On 2-domination and independence domination numbers of graphs. Ars Combin. (in press)"},{"key":"1040_CR88","doi-asserted-by":"crossref","first-page":"29","DOI":"10.7151\/dmgt.1256","volume":"25","author":"J. Harant","year":"2005","unstructured":"Harant J., Henning M.A.: On double domination in graphs. Discuss. Math. Graph Theory 25, 29\u201334 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR89","first-page":"11","volume":"76","author":"J. Harant","year":"2008","unstructured":"Harant J., Henning M.A.: A realization algorithm for double domination in graphs. Util. Math. 76, 11\u201324 (2008)","journal-title":"Util. Math."},{"key":"1040_CR90","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(94)00373-Q","volume":"155","author":"F. Harary","year":"1996","unstructured":"Harary F., Haynes T.W.: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Math. 155, 99\u2013105 (1996)","journal-title":"Discrete Math."},{"key":"1040_CR91","first-page":"161","volume":"48","author":"F. Harary","year":"1998","unstructured":"Harary F., Haynes T.W.: The k-tuple domatic number of a graph. Math. Slovaca 48, 161\u2013166 (1998)","journal-title":"Math. Slovaca"},{"key":"1040_CR92","first-page":"201","volume":"55","author":"F. Harary","year":"2000","unstructured":"Harary F., Haynes T.W.: Double domination in graphs. Ars Combin. 55, 201\u2013213 (2000)","journal-title":"Ars Combin."},{"key":"1040_CR93","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0012-365X(02)00496-X","volume":"262","author":"T.W. Haynes","year":"2003","unstructured":"Haynes T.W., Hedetniemi S.T., Henning M.A., Slater P.J.: H-forming sets in graphs. Discrete Math. 262, 159\u2013169 (2003)","journal-title":"Discrete Math."},{"key":"1040_CR94","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"1040_CR95","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"1040_CR96","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.disc.2005.09.012","volume":"304","author":"T.W. Haynes","year":"2005","unstructured":"Haynes T.W., Henning M.A.: Trees with two disjoint minimum independent dominating sets. Discrete Math. 304, 69\u201378 (2005)","journal-title":"Discrete Math."},{"key":"1040_CR97","first-page":"139","volume":"78","author":"T.W. Haynes","year":"2009","unstructured":"Haynes T.W., Thacker D.: Double domination edge critical graphs. Util. Math. 78, 139\u2013149 (2009)","journal-title":"Util. Math."},{"key":"1040_CR98","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.: Domination in trees: models and algorithms. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 423\u2013442. Wiley, New York (1985)"},{"key":"1040_CR99","doi-asserted-by":"crossref","first-page":"13","DOI":"10.7151\/dmgt.1255","volume":"25","author":"M.A. Henning","year":"2005","unstructured":"Henning M.A.: Graphs with large double domination numbers. Discuss. Math. Graph Theory 25, 13\u201328 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR100","first-page":"11","volume":"160","author":"M.A. Henning","year":"1991","unstructured":"Henning M.A., Oellermann O.R., Swart H.C.: Bounds on distance domination parameters. J. Combin. Inform. Syst. Sci. 160, 11\u201318 (1991)","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"1040_CR101","first-page":"19","volume":"22","author":"G. Hopkins","year":"1986","unstructured":"Hopkins G., Staton W.: Vertex partition and k-small subsets of graphs. Ars Combin. 22, 19\u201324 (1986)","journal-title":"Ars Combin."},{"key":"1040_CR102","unstructured":"Ionascu, E.J., Pritikin, D., Wright, S.E.: k-dependence and domination in Kings graphs (2006, preprint). arXiv:math0608140v1"},{"key":"1040_CR103","first-page":"7","volume":"68","author":"M.S. Jacobson","year":"1989","unstructured":"Jacobson M.S., Peters K.: Complexity questions for n-domination and related parameters. Congr. Numer. 68, 7\u201322 (1989)","journal-title":"Congr. Numer."},{"key":"1040_CR104","first-page":"151","volume":"29B","author":"M.S. Jacobson","year":"1990","unstructured":"Jacobson M.S., Peters K., Rall D.F.: On n-irredundance and n-domination. Ars Combin. 29B, 151\u2013160 (1990)","journal-title":"Ars Combin."},{"key":"1040_CR105","first-page":"728","volume":"274","author":"F. Jaeger","year":"1972","unstructured":"Jaeger F., Payan C.: Relations du type Nordhaus-Gaddum pour le nombre d\u2019arbsoption d\u2019un graphs simple. C. R. Acad. Sci. Paris 274, 728\u2013730 (1972)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1040_CR106","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(00)00215-8","volume":"109","author":"A. Jagota","year":"2001","unstructured":"Jagota A., Narasimhan G., \u0160olt\u00e9s L.: A generalization of maximal independent sets. Discrete Appl. Math. 109, 223\u2013235 (2001)","journal-title":"Discrete Appl. Math."},{"key":"1040_CR107","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<241::AID-JGT4>3.0.CO;2-S","volume":"32","author":"F. Jelen","year":"1999","unstructured":"Jelen F.: k-Independence and the k-residue of a graph. J. Graph Theory 32, 241\u2013249 (1999)","journal-title":"J. Graph Theory"},{"key":"1040_CR108","first-page":"73","volume":"5","author":"R. Kala","year":"2008","unstructured":"Kala R., Nirmala Vasantha T.R.: Restrained double domination number of a graph. AKCE Int. J. Graphs Comb. 5, 73\u201382 (2008)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"1040_CR109","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10587-009-0036-0","volume":"59","author":"K. K\u00e4mmerling","year":"2009","unstructured":"K\u00e4mmerling K., Volkmann L.: The k-domatic number of a graph. Czechoslov. Math. J. 59, 539\u2013550 (2009)","journal-title":"Czechoslov. Math. J."},{"key":"1040_CR110","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.4134\/JKMS.2009.46.6.1309","volume":"46","author":"K. K\u00e4mmerling","year":"2009","unstructured":"K\u00e4mmerling K., Volkmann L.: Roman k-domination in graphs. J. Korean Math. Soc. 46, 1309\u20131318 (2009)","journal-title":"J. Korean Math. Soc."},{"key":"1040_CR111","first-page":"49","volume":"186","author":"H. Karami","year":"2007","unstructured":"Karami H., Khodkar A., Sheikholeslami S.M.: Trees whose double domination number is twice their domination number. Congr. Numer. 186, 49\u201356 (2007)","journal-title":"Congr. Numer."},{"key":"1040_CR112","first-page":"77","volume":"177","author":"A. Khodkar","year":"2005","unstructured":"Khodkar A., Sheikholeslami S.M., Hasanzadeh H.: Bounds on double domination numbers of graphs. Congr. Numer. 177, 77\u201387 (2005)","journal-title":"Congr. Numer."},{"key":"1040_CR113","first-page":"131","volume":"37","author":"A. Khodkar","year":"2007","unstructured":"Khodkar A., Sheikholeslami S.M.: On perfect double dominating sets in grids, cylinders and tori. Australas. J. Combin. 37, 131\u2013139 (2007)","journal-title":"Australas. J. Combin."},{"key":"1040_CR114","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R. Klasing","year":"2004","unstructured":"Klasing R., Laforest C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inform. Process. Lett. 89, 75\u201383 (2004)","journal-title":"Inform. Process. Lett."},{"key":"1040_CR115","doi-asserted-by":"crossref","first-page":"361","DOI":"10.7151\/dmgt.1411","volume":"28","author":"T. Korneffel","year":"2008","unstructured":"Korneffel T., Meierling D., Volkmann L.: A remark on the (2,2)-domination number. Discuss. Math. Graph Theory 28, 361\u2013366 (2008)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR116","unstructured":"Kulli, V.: On n-total domination number in graphs. Graph theory, combinatorics, algorithms, and applications, pp. 319\u2013324. SIAM, Philadelphia (1991)"},{"key":"1040_CR117","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"C.-S. Liao","year":"2003","unstructured":"Liao C.-S., Chang G.J.: k-tuple domination in graphs. Inform. Process. Lett. 87, 45\u201350 (2003)","journal-title":"Inform. Process. Lett."},{"key":"1040_CR118","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz L.: On the ratio of optimal and integral fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"1040_CR119","doi-asserted-by":"crossref","first-page":"157","DOI":"10.7494\/OpMath.2009.29.2.157","volume":"29","author":"Y. Lu","year":"2009","unstructured":"Lu Y., Hou X., Xu J.: A note on the p-domination number of trees. Opuscula Math. 29, 157\u2013164 (2009)","journal-title":"Opuscula Math."},{"key":"1040_CR120","doi-asserted-by":"crossref","first-page":"185","DOI":"10.7151\/dmgt.1486","volume":"30","author":"Y. Lu","year":"2010","unstructured":"Lu Y., Hou X., Xu J.: On the (2, 2)-domination number of trees. Discuss. Math. Graph Theory 30, 185\u2013199 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR121","unstructured":"Lu, Y., Hou, X., Xu, J., Li, N.: Trees with unique minimum p-dominating sets. Util. Math. (in press)"},{"key":"1040_CR122","doi-asserted-by":"crossref","first-page":"425","DOI":"10.7151\/dmgt.1504","volume":"30","author":"Y. Lu","year":"2010","unstructured":"Lu Y., Hou X., Xu J., Li N.: A characterization of (\u03b3 t , \u03b3 2)-trees. Discuss. Math. Graph Theory 30, 425\u2013435 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1040_CR123","first-page":"11","volume":"66","author":"R.B. Maddox","year":"1988","unstructured":"Maddox R.B.: On k-dependent subsets and partitions of k-degenerate graphs. Congr. Numer. 66, 11\u201314 (1988)","journal-title":"Congr. Numer."},{"key":"1040_CR124","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.12988\/imf.2006.06089","volume":"21-24","author":"J. Mehri","year":"2006","unstructured":"Mehri J., Mirnia M., Sheikholeslami S.M.: 3-tuple domination number in complete grid graphs. Int. Math. Forum 21-24, 1099\u20131112 (2006)","journal-title":"Int. Math. Forum"},{"key":"1040_CR125","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A. Meir","year":"1975","unstructured":"Meir A., Moon J.W.: Relations between packing and covering number of a tree. Pacific J. Math. 61, 225\u2013233 (1975)","journal-title":"Pacific J. Math."},{"key":"1040_CR126","unstructured":"Ore, O.: Theory of Graphs. In: Amer. Math. Soc. Colloq. Publ. vol. 38. Amer. Math. Soc., Providence (1962)"},{"key":"1040_CR127","first-page":"307","volume":"17","author":"C. Payan","year":"1975","unstructured":"Payan C.: Sur le nombre d\u2019absorption d\u2019un graphe simple. Cahiers Centre \u00c9tudes Recherche Op\u00e9r. 17, 307\u2013317 (1975)","journal-title":"Cahiers Centre \u00c9tudes Recherche Op\u00e9r."},{"key":"1040_CR128","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190060104","volume":"6","author":"C. Payan","year":"1982","unstructured":"Payan C., Xuong N.H.: Domination-balanced graphs. J. Graph Theory 6, 23\u201332 (1982)","journal-title":"J. Graph Theory"},{"key":"1040_CR129","unstructured":"Pepper, R.: Implications of some observations about the k-domination number (in press)"},{"key":"1040_CR130","unstructured":"Prince, N.: Nordhaus-Gaddum bounds for k-domination in graphs (in press)"},{"key":"1040_CR131","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0012-365X(98)00103-4","volume":"191","author":"B. Randerath","year":"1998","unstructured":"Randerath B., Volkmann L.: Characterization of graphs with equal domination and covering number. Discrete Math. 191, 159\u2013169 (1998)","journal-title":"Discrete Math."},{"key":"1040_CR132","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.aml.2006.03.006","volume":"20","author":"D. Rautenbach","year":"2007","unstructured":"Rautenbach D., Volkmann L.: New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett. 20, 98\u2013102 (2007)","journal-title":"Appl. Math. Lett."},{"key":"1040_CR133","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/2589113","volume":"107","author":"C.S. ReVelle","year":"2000","unstructured":"ReVelle C.S., Rosing K.E.: Defendens imperium romanum: a classical problem in military strategy. Am. Math. Mon. 107, 585\u2013594 (2000)","journal-title":"Am. Math. Mon."},{"key":"1040_CR134","unstructured":"Shaheen, R.S.: Bounds for the 2-domination number of toroidal grid graphs. In: First Conference on Mathematical Sciences, pp. 359\u2013363. Zarqu Priv. Univ., Zarka (2006)"},{"key":"1040_CR135","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1016\/j.aml.2010.06.016","volume":"23","author":"S.M. Sheikholeslami","year":"2010","unstructured":"Sheikholeslami S.M., Volkmann L.: The Roman domatic number of a graph. Appl. Math. Lett. 23, 1295\u20131300 (2010)","journal-title":"Appl. Math. Lett."},{"key":"1040_CR136","unstructured":"Sheikholeslami, S.M., Volkmann, L.: The Roman k-domatic number of a graph. Acta Math. Sin. (Engl. Ser.). (in press)"},{"key":"1040_CR137","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I. Steward","year":"1999","unstructured":"Steward I.: Defend the Roman Empire!. Sci. Am. 281, 136\u2013139 (1999)","journal-title":"Sci. Am."},{"key":"1040_CR138","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/jgt.3190170306","volume":"17","author":"C. Stracke","year":"1993","unstructured":"Stracke C., Volkmann L.: A new domination conception. J. Graph Theory 17, 315\u2013323 (1993)","journal-title":"J. Graph Theory"},{"key":"1040_CR139","unstructured":"Topp, J.: Domination, independence and irredundance in graphs. Dissertationes Math. (Rozprawy Mat.) 342 (1995)"},{"key":"1040_CR140","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-9144-6","volume-title":"Graphen und Digraphen: Eine Einf\u00fchrung in die Graphentheorie, vol. XIII","author":"L. Volkmann","year":"1991","unstructured":"Volkmann L.: Graphen und Digraphen: Eine Einf\u00fchrung in die Graphentheorie, vol. XIII. Springer, Wien (1991)"},{"key":"1040_CR141","doi-asserted-by":"crossref","first-page":"273","DOI":"10.21136\/MB.2004.134148","volume":"129","author":"L. Volkmann","year":"2004","unstructured":"Volkmann L.: On perfect and unique maximum independent sets in graphs. Math. Bohemica 129, 273\u2013282 (2004)","journal-title":"Math. Bohemica"},{"key":"1040_CR142","unstructured":"Volkmann, L.: Graphen an allen Ecken und Kanten, vol. XVI. RWTH Aaachen (2006). http:\/\/www.math2.rwth-aachen.de\/files\/gt\/buch\/graphen_an_allen_ecken_und_kanten.pdf"},{"key":"1040_CR143","first-page":"159","volume":"61","author":"L. Volkmann","year":"2007","unstructured":"Volkmann L.: Some remarks on lower bounds on the p-domination number in trees. J. Combin. Math. Combin. Comput. 61, 159\u2013167 (2007)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR144","first-page":"227","volume":"64","author":"L. Volkmann","year":"2008","unstructured":"Volkmann L.: A Nordhaus-Gaddum-type result for the 2-domination number. J. Combin. Math. Combin. Comput. 64, 227\u2013235 (2008)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1040_CR145","first-page":"81","volume":"79","author":"L. Volkmann","year":"2009","unstructured":"Volkmann L.: Connected p-domination in graphs. Util. Math. 79, 81\u201390 (2009)","journal-title":"Util. Math."},{"key":"1040_CR146","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10587-010-0019-1","volume":"60","author":"L. Volkmann","year":"2010","unstructured":"Volkmann L.: A bound on the k-domination number of a graph. Czechoslov. Math. J. 60, 77\u201383 (2010)","journal-title":"Czechoslov. Math. J."},{"key":"1040_CR147","unstructured":"Volkmann, L.: Bounds on the k-tuple domatic number of a graph. Math. Slovaca (in press)"},{"key":"1040_CR148","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1016\/j.aml.2009.02.004","volume":"22","author":"B. Wang","year":"2009","unstructured":"Wang B., Xiang K.N.: On k-tuple domination of random graphs. Appl. Math. Lett. 22, 1513\u20131517 (2009)","journal-title":"Appl. Math. Lett."},{"key":"1040_CR149","unstructured":"Wei, V.K.: A lower bound on the stablity number of a simple graph. Bell Laboratories Technical Memorandum 81-11217-9, Murray Hill (1981)"},{"key":"1040_CR150","doi-asserted-by":"crossref","first-page":"R37","DOI":"10.37236\/1581","volume":"8","author":"B. Wieland","year":"2001","unstructured":"Wieland B., Godbole A.P.: On the domination number of a random graph. Electron J. Combin. 8, R37 (2001)","journal-title":"Electron J. Combin."},{"key":"1040_CR151","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.aml.2007.03.015","volume":"21","author":"G. Xu","year":"2008","unstructured":"Xu G., Kang L., Shan E., Yan H.: Proof of a conjecture on k-tuple domination in graphs. Appl. Math. Lett. 21, 287\u2013290 (2008)","journal-title":"Appl. Math. Lett."},{"key":"1040_CR152","doi-asserted-by":"crossref","first-page":"309","DOI":"10.21136\/CMJ.1983.101879","volume":"33","author":"B. Zelinka","year":"1983","unstructured":"Zelinka B.: On k-domatic numbers of graphs. Czechoslov. Math. J. 33, 309\u2013313 (1983)","journal-title":"Czechoslov. Math. J."},{"key":"1040_CR153","first-page":"313","volume":"34","author":"B. Zelinka","year":"1984","unstructured":"Zelinka B.: On k-ply domatic numbers of graphs. Math. Slovaka 34, 313\u2013318 (1984)","journal-title":"Math. Slovaka"},{"key":"1040_CR154","unstructured":"Zelinka, B.: Domatic numbers of graphs and their variants: a survey. In [95], pp 351\u2013374 (1998)"},{"issue":"121","key":"1040_CR155","doi-asserted-by":"crossref","first-page":"489","DOI":"10.21136\/CMJ.1996.127310","volume":"46","author":"S. Zhou","year":"1996","unstructured":"Zhou S.: On f-domination number of a graph. Czechoslov. Math. J. 46(121), 489\u2013499 (1996)","journal-title":"Czechoslov. Math. J."},{"issue":"125","key":"1040_CR156","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1022470802343","volume":"50","author":"S. Zhou","year":"2000","unstructured":"Zhou S.: Inequalities involving independence domination, f-domination, connected and total f-domination numbers. Czechoslov. Math. J. 50(125), 321\u2013330 (2000)","journal-title":"Czechoslov. Math. J."},{"key":"1040_CR157","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/j.aml.2007.10.016","volume":"21","author":"V. Zverovich","year":"2008","unstructured":"Zverovich V.: The k-tuple domination number revisited. Appl. Math. Lett. 21, 1005\u20131011 (2008)","journal-title":"Appl. Math. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1040-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1040-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1040-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T08:24:58Z","timestamp":1637483098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1040-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,8]]},"references-count":157,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["1040"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1040-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,8]]}}}