Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Frucht R., Harary F., On the corona of two graphs, Aequationes Math., 1970, 4, 322–324
Galeana-Sanchez H., Ramirez L.A.J., Monochromatic kernel-perfectness of special classes of digraphs, Discuss. Math. Graph Theory, 2007, 27, 389–400
Topp J., Domination independence and irredundance in graphs, Dissertationes Math., Warszawa, 1995
Włoch I., On imp-sets and kernels by monochromatic paths of the duplication, Ars Combin., 2007, 83, 93–99
Włoch I., On kernels by monochromatic paths in D-join, preprint
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Włoch, I. On kernels by monochromatic paths in the corona of digraphs. centr.eur.j.math. 6, 537–542 (2008). https://doi.org/10.2478/s11533-008-0044-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2478/s11533-008-0044-6