Abstract
We consider the problem of describing \(n\)-vertex trees of diameter \(d\) containing as few independent sets as possible. This problem is solved for \(d=6\) and \(n>160\), as well as for \(d=7\) and \(n>400\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Prodinger and R. F. Tichy, “Fibonacci numbers of graphs,” Fibonacci Quart. 19 (1), 16–21 (1982).
A. S. Pedersen and P. D. Vestergaard, “An upper bound on the number of independent sets in a tree,” Ars Combin. 84, 85–96 (2007).
A. B. Dainiak, Sharp Bounds for the Number of Maximal Independent Sets in Trees of Fixed Diameter, arXiv: 0812.4948 (2008).
A. Frendrup, A. S. Pedersen, A. A. Sapozhenko, and P. D. Vestergaard, “Merrifield–Simmons index and minimum number of independent sets in short trees,” Ars Combin. 111, 85–95 (2013).
A. B. Dainiak, “On the number of independent sets in trees of fixed diameter,” J. Appl. Industr. Math. 4 (2), 163–171 (2009).
Funding
The paper was prepared in the course of studies in the framework of the Basic Research Program at National Research University Higher School of Economics (HSE).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Taletskii, D.S. Trees of Diameter 6 and 7 with Minimum Number of Independent Sets. Math Notes 109, 280–291 (2021). https://doi.org/10.1134/S0001434621010326
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434621010326