• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Trees of Diameter 6 and 7 with Minimum Number of Independent Sets

Mathematical notes. 2021. Vol. 109. P. 280-291.

We consider the problem of describing 𝑛-vertex trees of diameter 𝑑 containing as few independent sets as possible. This problem is solved for 𝑑=6 and 𝑛>160, as well as for 𝑑=7 and 𝑛>400.