Constraints on the number of maximal independent sets in graphs

DOI10.1002/jgt.3190180211zbMath0792.05081OpenAlexW1998747828MaRDI QIDQ4284106

Jiuqiang Liu

Publication date: 24 July 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180211

zbMATH Keywords

independent setslongest pathvertex-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (5)

Graphs, partitions and Fibonacci numbers ⋮ The maximum number of maximum dissociation sets in trees ⋮ Minimum number of maximal dissociation sets in trees ⋮ Independent sets in graphs ⋮ Counting stable sets on Cartesian products of graphs

Cites Work

• Unnamed Item
• The maximum number of cliques in dense graphs
• Graphs with unique maximum independent sets
• The number of maximal independent sets in a connected graph
• On generating all maximal independent sets
• Bipartite graphs can have any number of independent sets
• 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
• On maximal independent sets of nodes in trees
• The structure and maximum number of maximum independent sets in trees
• On cliques in graphs

This page was built for publication: Constraints on the number of maximal independent sets in graphs