The maximum number of maximal independent sets in unicyclic connected graphs

DOI10.1016/j.disc.2007.07.079zbMath1207.05142OpenAlexW2002646974MaRDI QIDQ932626

C. Y. Goh, Khee Meng Koh, Fengming Dong

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.079

zbMATH Keywords

extremal graphsunicyclic graphsforests(Maximal) independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ The maximum number of maximum dissociation sets in trees ⋮ Maximum dissociation sets in subcubic trees ⋮ Minimum number of maximal dissociation sets in trees ⋮ On the maximum number of maximum dissociation sets in trees with given dissociation number ⋮ On the maximum number of minimum dominating sets in forests ⋮ Independent sets in graphs ⋮ On the maximum number of maximum independent sets ⋮ Coverings, Matchings and the number of maximal independent sets of graphs ⋮ Maximal independent sets in caterpillar graphs

Cites Work

• The number of maximal independent sets in a connected graph
• The number of maximal independent sets in connected triangle-free graphs
• Maximal independent sets in graphs with at most one cycle
• The number of independent sets in unicyclic graphs
• Maximal independent sets in graphs with at mostr cycles
• Maximal and maximum independent sets in graphs with at mostr cycles
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs

This page was built for publication: The maximum number of maximal independent sets in unicyclic connected graphs