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 条

[41] PARALLEL ALGORITHMS FOR FRACTIONAL AND MAXIMAL INDEPENDENT SETS IN PLANAR GRAPHS
DADOUN, N
KIRKPATRICK, DG
DISCRETE APPLIED MATHEMATICS, 1990, 27 (1-2) : 69 - 83
[42] Maximal independent sets in graphs with cyclomatic number at most two
Li, Shuchao
Jing, Wei
UTILITAS MATHEMATICA, 2010, 83 : 107 - 120
[43] Maximal independent sets in bipartite graphs with at least one cycle
Li, Shuchao
Zhang, Huihui
Zhang, Xiaoyan
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (02): : 243 - 258
[44] COUNTING MAXIMAL DISTANCE-INDEPENDENT SETS IN GRID GRAPHS
Euler, Reinhardt
Oleksik, Pawel
Skupien, Zdzislaw
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (03) : 531 - 557
[45] All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs
Eppstein, David
ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (04)
[46] The number of maximal independent sets in connected triangle-free graphs
Chang, GJ
Jou, MJ
DISCRETE MATHEMATICS, 1999, 197 (1-3) : 169 - 178
[47] On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities
Hartnell, Bert L.
Rall, Douglas F.
GRAPHS AND COMBINATORICS, 2013, 29 (03) : 519 - 525
[48] The number of maximal independent sets in connected triangle-free graphs
Chang, Gerard J.
Jou, Min-Jen
Discrete Mathematics, 1999, 197-198 : 169 - 178
[49] On disjoint maximum and maximal independent sets in graphs and inverse independence number
Kaci, Fatma
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (08)
[50] A parallel algorithm to generate all maximal independent sets on permutation graphs
Pal, M
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 67 (3-4) : 261 - 274

← 1 2 3 4 5 →