Kernel in Oriented Circulant Graphs

被引：0
|
作者：
Manuel, Paul [1 ]
Rajasingh, Indra [2 ]
Rajan, Bharati [2 ]
Punitha, Joice [3 ]
机构：
[1] Kuwait Univ, Dept Informat Sci, Kuwait 13060, Kuwait
[2] Loyola Coll, Dept Math, Madras 600034, Tamil Nadu, India
[3] R M D Engn Coll, Dept Math, Kavaraipettai 601206, India
来源：
COMBINATORIAL ALGORITHMS | 2009年 / 5874卷
关键词：
oriented graph; kernel; strong kernel number; NP-complete; strongly connected;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 (a, 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.
引用
收藏
页码：396 / +
页数：2
相关论文
共 50 条
  • [11] On embeddings of circulant graphs
    Conder, Marston
    Grande, Ricardo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (02):
  • [12] Resolvability in circulant graphs
    Muhammad Salman
    Imran Javaid
    Muhammad Anwar Chaudhry
    Acta Mathematica Sinica, English Series, 2012, 28 : 1851 - 1864
  • [13] On Gorenstein circulant graphs
    Nikseresht, Ashkan
    Oboudi, Mohammad Reza
    DISCRETE MATHEMATICS, 2023, 346 (07)
  • [14] Resolvability in Circulant Graphs
    Muhammad SALMAN
    Imran JAVAID
    Muhammad Anwar CHAUDHRY
    Acta Mathematica Sinica,English Series, 2012, (09) : 1851 - 1864
  • [15] On circulant nut graphs
    Damnjanovic, Ivan
    Stevanovic, Dragan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 633 : 127 - 151
  • [16] Domination in Circulant Graphs
    Rad, Nader Jafari
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2009, 17 (01): : 169 - 176
  • [17] Resolvability in Circulant Graphs
    Salman, Muhammad
    Javaid, Imran
    Chaudhry, Muhammad Anwar
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2012, 28 (09) : 1851 - 1864
  • [18] Resolvability in Circulant Graphs
    Muhammad SALMAN
    Imran JAVAID
    Muhammad Anwar CHAUDHRY
    Acta Mathematica Sinica, 2012, 28 (09) : 1851 - 1864
  • [19] Strong Kernel Number in Certain Oriented Cycle Extension of Graphs
    Punitha, M. Joice
    MATHEMATICS IN COMPUTER SCIENCE, 2015, 9 (02) : 193 - 199
  • [20] DISSOCIATION IN CIRCULANT GRAPHS AND INTEGER DISTANCE GRAPHS
    Huang, Jia
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024,
12345