In this paper we derive necessary and sufficient conditions for the existence of kernels by monochromatic paths in the corona of digraphs. Using these results, we are able to prove the main result of this paper which provides necessary and sufficient conditions for the corona of digraphs to be monochromatic kernel-perfect. Moreover we calculate the total numbers of kernels by monochromatic paths, independent by monochromatic paths sets and dominating by monochromatic paths sets in this digraphs product.
@article{bwmeta1.element.doi-10_2478_s11533-008-0044-6,
author = {Iwona W\l och},
title = {On kernels by monochromatic paths in the corona of digraphs},
journal = {Open Mathematics},
volume = {6},
year = {2008},
pages = {537-542},
zbl = {1152.05033},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_2478_s11533-008-0044-6}
}
Iwona Włoch. On kernels by monochromatic paths in the corona of digraphs. Open Mathematics, Tome 6 (2008) pp. 537-542. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_2478_s11533-008-0044-6/
[1] Frucht R., Harary F., On the corona of two graphs, Aequationes Math., 1970, 4, 322–324 http://dx.doi.org/10.1007/BF01844162 | Zbl 0198.29302
[2] Galeana-Sanchez H., Ramirez L.A.J., Monochromatic kernel-perfectness of special classes of digraphs, Discuss. Math. Graph Theory, 2007, 27, 389–400 | Zbl 1142.05037
[3] Topp J., Domination independence and irredundance in graphs, Dissertationes Math., Warszawa, 1995 | Zbl 0830.05052
[4] Włoch I., On imp-sets and kernels by monochromatic paths of the duplication, Ars Combin., 2007, 83, 93–99 | Zbl 1174.05114
[5] Włoch I., On kernels by monochromatic paths in D-join, preprint