A kernel in a directed graph D(V,E) is a set S of vertices of D such that no two vertices in S are adjacent and for every vertex u in V / S there is a vertex v in S , such that (u, v) is an arc of D. The problem of existence of a kernel is NP-complete for a general digraph. In this paper we introduce the strong kernel problem of an undirected graph G and solve it in polynomial time for circulant graphs. © Springer-Verlag Berlin Heidelberg 2009.

Indra Rajasingh

Mathematics

School of Advanced Sciences

Chennai Campus

P. Manuel

B. Rajan

J. Punitha

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Kernel in Oriented Circulant Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Kernel in oriented circulant graphs

Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN	03029743