Independent perfect domination sets in Cayley graphs

被引：65
|
作者：
Lee, J [1 ]
机构：
[1] Yeungnam Univ, Dept Math, Kyongsan 712749, South Korea
来源：
JOURNAL OF GRAPH THEORY | 2001年 / 37卷 / 04期
关键词：
D O I：
10.1002/jgt.1016
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube Q(n) has an independent perfect domination set if and only if Q(n) is a regular covering of the complete graph Kn+1 if and only if n = 2(m) - 1 for some natural number m. (C) 2001 John Wiley & Sons, Inc.
引用
收藏
页码：213 / 219
页数：7
相关论文
共 50 条
  • [1] Perfect domination sets in Cayley graphs
    Kwon, Young Soo
    Lee, Jaeun
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 259 - 263
  • [2] Independent perfect dominating sets in semi-Cayley graphs
    Wang, Xiaomeng
    Xu, Shou-Jun
    Li, Xianyue
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 50 - 57
  • [3] Perfect graphs of strong domination and independent strong domination
    Rautenbach, D
    Zverovich, VE
    DISCRETE MATHEMATICS, 2001, 226 (1-3) : 297 - 311
  • [4] WEIGHTED INDEPENDENT PERFECT DOMINATION ON COCOMPARABILITY GRAPHS
    CHANG, GJ
    RANGAN, CP
    COORG, SR
    DISCRETE APPLIED MATHEMATICS, 1995, 63 (03) : 215 - 222
  • [5] On the number of independent sets in damaged Cayley graphs
    Omelyanov, K. G.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2005, 15 (04): : 361 - 364
  • [6] Domination in Cayley graphs: A survey
    Chelvam, T. Tamizh
    Sivagami, M.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2019, 16 (01) : 27 - 40
  • [7] Domination and Signed Domination Number of Cayley Graphs
    Vatandoost, Ebrahim
    Ramezani, Fatemeh
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2019, 14 (01): : 35 - 42
  • [8] Finding Independent Sets in Unions of Perfect Graphs
    Chakaravarthy, Venkatesan T.
    Pandit, Vinayaka
    Roy, Sambuddha
    Sabharwal, Yogish
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 251 - 259
  • [9] PERFECT CODES IN CAYLEY GRAPHS
    Huang, He
    Xia, Binzhou
    Zhou, Sanming
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 548 - 559
  • [10] Efficient open domination in Cayley graphs
    Chelvam, T. Tamizh
    Mutharasu, Sivagnanam
    APPLIED MATHEMATICS LETTERS, 2012, 25 (10) : 1560 - 1564
12345