Trees with the second largest number of maximal independent sets

DOI10.1016/j.disc.2009.02.007zbMath1187.05026OpenAlexW3151182529MaRDI QIDQ1043975

Jenq-Jong Lin, Min-Jen Jou

Publication date: 10 December 2009

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

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

zbMATH Keywords

treeforestextremal graphmaximal independent set

Mathematics Subject Classification ID

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

Related Items (4)

The second largest number of maximal independent sets in connected graphs with at most one cycle ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ Independent sets in graphs ⋮ On the third largest number of maximal independent sets of graphs

Cites Work

• Graphs with the second largest number of maximal independent sets
• Maximal independent sets in graphs with at most one cycle
• Graphs, partitions and Fibonacci numbers
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with the second largest number of maximal independent sets