%0 Journal Article
%T Kernels in circulant digraphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Lakshmi, R.
%A Vidhyapriya, S.
%D 2014
%\ 06/01/2014
%V 3
%N 2
%P 45-49
%! Kernels in circulant digraphs
%K Kernel
%K Symmetric Digraphs
%K Circulant Digraph
%R 10.22108/toc.2014.4777
%X A kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w,in,V(D),setminus,J$ there exists an arc from $w$ to a vertex in $J.$ In this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. This characterization is a partial solution to the following problem: Characterize circulant digraphs which have kernels; it appeared in the book Digraphs - theory, algorithms and applications, Second Edition, Springer-Verlag, 2009, by J. Bang-Jensen and G. Gutin.
%U https://toc.ui.ac.ir/article_4777_9925aa9b3c368bb5a7b3527a835e19f9.pdf