Trees with extremal numbers of maximal independent sets including the set of leaves

DOI10.1016/j.disc.2007.08.087zbMath1158.05047OpenAlexW2013101429MaRDI QIDQ942106

Iwona Włoch

Publication date: 4 September 2008

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

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

zbMATH Keywords

treesmaximal independent set

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ Total graph interpretation of the numbers of the Fibonacci type ⋮ The maximum number of maximum dissociation sets in trees ⋮ Minimum number of maximal dissociation sets in trees ⋮ On a new type of distance Fibonacci numbers ⋮ On the maximum number of minimum dominating sets in forests ⋮ Independent sets in graphs ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ On the maximum number of maximum independent sets ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Fibonacci numbers and Lucas numbers in graphs ⋮ Maximal independent sets in caterpillar graphs

Cites Work

• The number of independent sets in unicyclic graphs
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The structure and maximum number of maximum independent sets in trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with extremal numbers of maximal independent sets including the set of leaves