The number of maximal independent sets of \((k+1)\)-valent trees (Q2504102): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Chang Woo Lee / rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Property / author | |||
Property / author: Chang Woo Lee / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659554 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of maximal independent sets in a connected graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5333061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525389 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On cliques in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on Independent Sets in Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Maximal Independent Sets in a Tree / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:38, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of maximal independent sets of \((k+1)\)-valent trees |
scientific article |
Statements
The number of maximal independent sets of \((k+1)\)-valent trees (English)
0 references
22 September 2006
0 references
The authors derive recurrence relations for the number of maximal independent sets of nodes in planted plane trees in which each node has degree one or \(k+1\). The results can readily be deduced from a special case of results by \textit{A. Meir} and \textit{J. W. Moon} [J. Graph Theory 12, No. 2, 265--283 (1988: Zbl 0655.05039)] who enumerated maximal independent sets in simply generated families of trees and, in addition, obtained asymptotic results on the number and the expected size of these sets.
0 references