On the number of maximal independent sets in complete \(q\)-ary trees

DOI10.1515/dma-2017-0032zbMath1441.05176OpenAlexW2761134972MaRDI QIDQ1744293

Dmitriy S. Malyshev, Dmitriy S. Taletskiy

Publication date: 23 April 2018

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

Full work available at URL: https://doi.org/10.1515/dma-2017-0032

zbMATH Keywords

maximal independent setcomplete \(q\)-ary tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Enumeration of matchings in complete \(q\)-ary trees

Cites Work

• The Number of Independent Sets in a Grid Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of maximal independent sets in complete \(q\)-ary trees