TY - JOUR
ID - 4777
TI - Kernels in circulant digraphs
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Lakshmi, R.
AU - Vidhyapriya, S.
AD - Department of Mathematics,
Annamalai University,
Annamalainagar 608 002
Tamilnadu.
AD - Department of Mathematics,
Annamalai University,
Annamalainagar 608 002,
Tamilnadu
Y1 - 2014
PY - 2014
VL - 3
IS - 2
SP - 45
EP - 49
KW - Kernel
KW - Symmetric Digraphs
KW - Circulant Digraph
DO - 10.22108/toc.2014.4777
N2 - 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.
UR - https://toc.ui.ac.ir/article_4777.html
L1 - https://toc.ui.ac.ir/article_4777_9925aa9b3c368bb5a7b3527a835e19f9.pdf
ER -