Author(s)

Jenq-Jong Lin, Min-Jen Jou

Ling Tung University, Taichung City.

A maximal independent set is an independent set that is not a proper subset of any other independent set. A connected graph (respectively, graph) G with vertex set V(G) is called a quasi-tree graph (respectively, quasi-forest graph), if there exists a vertex x ∈V(G) such that G − x is a tree (respectively, forest). In this paper, we survey on the large numbers of maximal independent sets among all trees, forests, quasi-trees and quasi-forests. In addition, we further look into the problem of determining the third largest number of maximal independent sets among all quasi-trees and quasi-forests. Extremal graphs achieving these values are also given.

Maximal Independent Set, Quasi-Tree Graph, Quasi-Forest Graph, Extremal Graph

Lin, J. and Jou, M. (2017) The Number of Maximal Independent Sets in Quasi-Tree Graphs and Quasi-Forest Graphs. Open Journal of Discrete Mathematics, 7, 134-147. doi: 10.4236/ojdm.2017.73013.