Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 2020, Volume 32, Issue 2, Pages 71–84
DOI: https://doi.org/10.4213/dm1554
(Mi dm1554)
 

Trees with a given number of leaves and the maximal number of maximum independent sets

D. S. Taletskiia, D. S. Malyshevb

a Lobachevski State University of Nizhni Novgorod
b State University – Higher School of Economics, Nizhny Novgorod Branch
References:
Abstract: A complete description of trees with maximal possible number of maximum independent sets among all $n$-vertex trees with exactly $l$ leaves is obtained. For all values of the parameters $n$ and $l$ the extremal tree is unique and is the result of merging the endpoints of $l$ simple paths.
Keywords: independent set, maximum independent set, maximal independent set, extremal tree.
Received: 06.12.2018
Revised: 14.05.2020
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 2, Pages 135–144
DOI: https://doi.org/10.1515/dma-2021-0012
Bibliographic databases:
Document Type: Article
UDC: 519.176+519.172.1
Language: Russian
Citation: D. S. Taletskii, D. S. Malyshev, “Trees with a given number of leaves and the maximal number of maximum independent sets”, Diskr. Mat., 32:2 (2020), 71–84; Discrete Math. Appl., 31:2 (2021), 135–144
Citation in format AMSBIB
\Bibitem{TalMal20}
\by D.~S.~Taletskii, D.~S.~Malyshev
\paper Trees with a given number of leaves and the maximal number of maximum independent sets
\jour Diskr. Mat.
\yr 2020
\vol 32
\issue 2
\pages 71--84
\mathnet{http://mi.mathnet.ru/dm1554}
\crossref{https://doi.org/10.4213/dm1554}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=4123501}
\elib{https://elibrary.ru/item.asp?id=46020660}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 2
\pages 135--144
\crossref{https://doi.org/10.1515/dma-2021-0012}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000640071300005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85104504286}
Linking options:
  • https://www.mathnet.ru/eng/dm1554
  • https://doi.org/10.4213/dm1554
  • https://www.mathnet.ru/eng/dm/v32/i2/p71
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:838
    Full-text PDF :256
    References:81
    First page:21
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025