Kernel-perfectness in digraphs obtained by some operations on digraphs

A kernel \(J\) of a digraph \(D\) is an independent set of vertices of \(D\) such that for every \(z∈ V(D) J\) there exists an arc from \(z\) to \(J.\) A digraph \(D\) is said to be kernel-perfect if every induced subdigraph of it has a kernel. We characterise kernel-perfectness in special families of digraphs, namely, the line digraph, the subdivision digraph, the middle digraph, the digraph \(R(D)\) and the total digraph. We also obtain some results on kernel-perfectness in the generalised Mycielskian of digraphs. Moreover, we find some new classes of kernel-perfect digraphs by introducing a new product on digraphs.