Pulse nav.journalClub Tendencias Explorar Preguntas Investigadores

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026Política de privacidad

Inicio Explorar nav.journalClub Tendencias

⌘+K

The Number of Maximal Independent Sets in a Tree | Synapse

January 1, 1986

The Number of Maximal Independent Sets in a Tree

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We find the largest number of maximal independent sets of vertices that any tree of n vertices can have.MSC codes05C0505C1505C35

Me gusta

Guardar

Compartir

Cite This Study

Herbert S. Wilf (Wed,) studied this question.

synapsesocial.com/papers/6a1e17b2e5e992f6039fd720 https://doi.org/https://doi.org/10.1137/0607015

Me gusta

Guardar

Compartir

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A note on the complexity of the chromatic number problem1976 · 222 citations
2On cliques in graphs1965 · 853 citations
3An Algorithm for Determining the Chromatic Number of a Graph1973 · 41 citations
4A New Algorithm for Generating All the Maximal Independent Sets1977 · 615 citations
5On the theory of graphs1954 · 261 citations