Strong Kernel Number in Certain Oriented Cycle Extension of Graphs
Autor: | M. Joice Punitha |
---|---|
Rok vydání: | 2015 |
Předmět: | |
Zdroj: | Mathematics in Computer Science. 9:193-199 |
ISSN: | 1661-8289 1661-8270 |
Popis: | 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 itself an NP-complete for a general digraph. But in this paper we solve the strong kernel problem for certain oriented Cycle Extension of graphs namely Circular Ladder and Petersen Graphs. |
Databáze: | OpenAIRE |
Externí odkaz: |