Maximal independent sets in caterpillar graphs

被引：10
|
作者：
Ortiz, Carmen [2 ]
Villanueva, Monica [1 ]
机构：
[1] Univ Santiago Chile, Fac Engn, Santiago, Chile
[2] Adolfo Ibanez Univ, Fac Sci & Engn, Santiago, Chile
来源：
DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 03期
关键词：
Graph algorithms; Caterpillar graph; Enumeration of maximal independent sets; Intersection graph; Independent graph; Clique graph; NUMBER; ALGORITHM; GENERATE; FAMILY;
D O I：
10.1016/j.dam.2011.10.024
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A caterpillar graph is a tree in which the removal of all pendant vertices results in a chordless path. In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P-complete. We provide a polynomial time algorithm to generate the whole family of mis in a caterpillar graph. We also characterize the independent graph (intersection graph of mis) and the clique graph (intersection graph of cliques) of complete caterpillar graphs. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：259 / 266
页数：8
相关论文
共 50 条
  • [21] INDEPENDENT SETS OF CARDINALITY s OF MAXIMAL OUTERPLANAR GRAPHS
    Estes, John
    Staton, William
    Wei, Bing
    FIBONACCI QUARTERLY, 2013, 51 (02): : 147 - 150
  • [22] Graphs with the second largest number of maximal independent sets
    Jin, Zemin
    Li, Xueliang
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5864 - 5870
  • [23] On graphs with the third largest number of maximal independent sets
    Hua, Hongbo
    Hou, Yaloping
    INFORMATION PROCESSING LETTERS, 2009, 109 (04) : 248 - 253
  • [24] The numbers of maximal independent sets in connected unicyclic graphs
    Lin, Jenq-Jong
    Jou, Min-Jen
    UTILITAS MATHEMATICA, 2016, 101 : 215 - 225
  • [25] Maximal independent sets in graphs with at most r cycles
    Ying, Goh Chee
    Meng, Koh Khee
    Sagan, Bruce E.
    Vatter, Vincent R.
    JOURNAL OF GRAPH THEORY, 2006, 53 (04) : 270 - 282
  • [26] Maximal independent sets in clique-free graphs
    He, Xiaoyu
    Nie, Jiaxi
    Spiro, Sam
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 106
  • [27] The largest number of maximal independent sets in twinkle graphs
    Lin, Jenq-Jong
    Jou, Min-Jen
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 109 : 3 - 13
  • [28] On the Third Largest Number of Maximal Independent Sets of Graphs
    Li, Shuchao
    Zhang, Huihui
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2016, 39 : S269 - S282
  • [29] On Maximal Det-Independent (Res-Independent) Sets in Graphs
    Muhammad Zill-E-Shams
    Usman Salman
    Graphs and Combinatorics, 2022, 38
  • [30] On Maximal Det-Independent (Res-Independent) Sets in Graphs
    Zill-E-Shams
    Salman, Muhammad
    Ali, Usman
    GRAPHS AND COMBINATORICS, 2022, 38 (02)
12345