The Number of Maximal Independent Sets in a Tree

From MaRDI portal
Publication:3708817

DOI10.1137/0607015zbMath0584.05024OpenAlexW1973664393MaRDI QIDQ3708817

Herbert S. Wilf

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/998c22aea3babc3de2a85489211eceb03ddad8fc




Related Items (42)

The number of maximal independent sets in trees with a given number of leavesGraphs, partitions and Fibonacci numbersMaximal and maximum dissociation sets in general and triangle-free graphsConstraints on the number of maximal independent sets in graphsThe number of maximal independent sets in a connected graphOn Trees of Bounded Degree with Maximal Number of Greatest Independent SetsMaximal independent sets in graphs with at most one cycleMaximal independent sets on a grid graphMaximum modulus of independence roots of graphs and treesTrees with maximum number of maximal matchingsMaximal independent sets in clique-free graphsThe maximum number of maximum dissociation sets in treesCounting maximal independent sets in some \(n\)-gonal cactiGeneralizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent setsOn the number of maximal independent sets: From Moon–Moser to Hujter–TuzaThe number of maximum matchings in a treeMaximum dissociation sets in subcubic treesMinimum number of maximal dissociation sets in treesOn the maximum number of maximum dissociation sets in trees with given dissociation numberOn the Number ofk-Dominating Independent SetsThe maximum number of maximal independent sets in unicyclic connected graphsOn the number of minimal transversals in 3-uniform hypergraphsTrees with extremal numbers of maximal independent sets including the set of leavesIndependent sets in graphsMaximal independent sets and maximal matchings in series-parallel and related graph classesThe inverse problem for certain tree parametersOn graphs with the third largest number of maximal independent setsCounting maximal independent sets in directed path graphsThe number of maximal independent sets of \((k+1)\)-valent treesCoverings, Matchings and the number of maximal independent sets of graphsTrees with a given number of leaves and the maximal number of maximum independent setsOn the maximum number of cliques in a graphGraphs with the second largest number of maximal independent setsMaximal independent sets and maximal matchings in series-parallel and related graph classesMaximal independent sets and regularity of graphsTrees without twin-leaves with smallest number of maximal independent setsMaximal independent sets in caterpillar graphsA finiteness theorem for maximal independent setsThe number of maximal independent sets in connected triangle-free graphsCounting stable sets on Cartesian products of graphsThe maximum clique problemTrees with minimum number of infima closed sets



Cites Work


This page was built for publication: The Number of Maximal Independent Sets in a Tree