@article{bwmeta1.element.doi-10_2478_s11533-010-0077-5,
author = {Maryam Atapour and Seyyed Sheikholeslami and Rana Hajypory and Lutz Volkmann},
title = {The signed k-domination number of directed graphs},
journal = {Open Mathematics},
volume = {8},
year = {2010},
pages = {1048-1057},
zbl = {1223.05092},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_2478_s11533-010-0077-5}
}
Maryam Atapour; Seyyed Sheikholeslami; Rana Hajypory; Lutz Volkmann. The signed k-domination number of directed graphs. Open Mathematics, Tome 8 (2010) pp. 1048-1057. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_2478_s11533-010-0077-5/
[1] Dunbar J.E., Hedetniemi S.T., Henning M.A., Slater P.J., Signed domination in graphs, In: Graph Theory, Combinatorics, and Algorithms, 1, Kalamazoo, 1992, Wiley-Intersci. Publ., Wiley, New York, 1995, 311–321 | Zbl 0842.05051
[2] Henning M.A., Slater P.J., Inequalities relating domination parameters in cubic graphs, Discrete Math., 1996, 158(1–3), 87–98 http://dx.doi.org/10.1016/0012-365X(96)00025-8 | Zbl 0858.05058
[3] Karami H., Sheikholeslami S.M., Khodkar A., Lower bounds on the signed domination numbers of directed graphs, Discrete Math., 2009, 309(8), 2567–2570 http://dx.doi.org/10.1016/j.disc.2008.04.001 | Zbl 1211.05117
[4] Szekeres G., Wilf H.S., An inequality for the chromatic number of a graph, J. Combin. Theory, 1968, 4, 1–3 http://dx.doi.org/10.1016/S0021-9800(68)80081-X | Zbl 0171.44901
[5] Wang C.P., The signed k-domination numbers in graphs, Ars Combin. (in press) | Zbl 1289.05363
[6] West D.B., Introduction to Graph Theory, 2nd ed., Prentice Hall, Upper Saddle River, 2000
[7] Zelinka B., Signed domination numbers of directed graphs, Czechoslovak Math. J., 2005, 55(130)(2), 479–482 http://dx.doi.org/10.1007/s10587-005-0038-5 | Zbl 1081.05042
[8] Zhang Z., Xu B., Li Y., Liu L., A note on the lower bounds of signed domination number of a graph, Discrete Math., 1999, 195(1–3), 295–298 http://dx.doi.org/10.1016/S0012-365X(98)00189-7 | Zbl 0928.05052