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

DOI10.1515/DMA-2017-0032zbMATH Open1441.05176OpenAlexW2761134972MaRDI QIDQ1744293FDOQ1744293

D. 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

Recommendations

• scientific article; zbMATH DE number 5924790
• The Number of Maximal Independent Sets in a Tree
• The structure and maximum number of maximum independent sets in trees
• scientific article; zbMATH DE number 6470693
• The number of maximal independent sets in trees with a given number of leaves
• On the number of independent sets in a tree
• The number of maximal independent sets of \((k+1)\)-valent trees
• Counting the maximal independent sets in trees with two degrees of maximum degree
• The number of maximal independent sets in trees and forests.
• On the number of independent sets in the trees of a fixed diameter

zbMATH Keywords

maximal independent setcomplete \(q\)-ary tree

Mathematics Subject Classification ID

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

Cites Work

• The Number of Independent Sets in a Grid Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
• The number of maximal independent sets of \((k+1)\)-valent trees
• Title not available (Why is that?)
• Enumeration of matchings in complete \(q\)-ary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744293)