Strong Kernel Number in Certain Oriented Cycle Extension of Graphs

Autor:	M. Joice Punitha
Rok vydání:	2015
Předmět:	Discrete mathematics Applied Mathematics Neighbourhood (graph theory) Digraph Directed graph Vertex (geometry) Combinatorics Computational Mathematics Computational Theory and Mathematics Computer Science::Discrete Mathematics Chordal graph Independent set Strong orientation Mathematics
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:	https://explore.openaire.eu/search/publication?articleId=doi_________::dc98a4a15c5c180848c33d7308efb781 https://doi.org/10.1007/s11786-015-0225-1 Zobrazit plný text záznamu Full text from SpringerLink