Kernels in circulant digraphs

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 charact...

Full description

Bibliographic Details
Main Authors: R. Lakshmi, S. Vidhyapriya
Format: Article
Language:English
Published: University of Isfahan 2014-06-01
Series:Transactions on Combinatorics
Subjects:
Online Access:http://www.combinatorics.ir/pdf_4777_9925aa9b3c368bb5a7b3527a835e19f9.html