On graphs with the third largest number of maximal independent sets

DOI10.1016/j.ipl.2008.10.013zbMath1189.05133OpenAlexW1980965858MaRDI QIDQ976086

Hong-Bo Hua, Yao-Ping Hou

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.013

zbMATH Keywords

combinatorial problemsextremal graphmaximal independent set

Mathematics Subject Classification ID

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

Related Items (4)

The number of maximal independent sets in trees with a given number of leaves ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ On the third largest number of maximal independent sets of graphs ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems

Cites Work

• Unnamed Item
• Graphs with the second largest number of maximal independent sets
• 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
• 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: On graphs with the third largest number of maximal independent sets