On maximal independent sets of nodes in trees

DOI10.1002/jgt.3190120217zbMath0655.05039OpenAlexW2024460738MaRDI QIDQ3801585

A. Meir, John W. Moon

Publication date: 1988

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

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

zbMATH Keywords

asymptotic enumerationtreesmaximal independent setsindependent nodes

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items

Asymptotic distributions and a multivariate Darboux method in enumeration problems, On generalized independent subsets of trees, Enumeration problems for classes of self-similar graphs, Constraints on the number of maximal independent sets in graphs, On the number of matchings of a tree, Listing all spanning trees in Halin graphs — sequential and Parallel view, Maximum number of fixed points in AND-OR-NOT networks, Independent sets in graphs, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Unnamed Item, Graphs with the second largest number of maximal independent sets, Maximal independent sets and maximal matchings in series-parallel and related graph classes, A finiteness theorem for maximal independent sets, Normal convergence problem? Two moments and a recurrence may be the clues, The number of maximal independent sets in connected triangle-free graphs

Cites Work

• On the Altitude of Nodes in Random Trees
• Unnamed Item