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, 2018, Volume 30, Issue 4, Pages 115–133
DOI: https://doi.org/10.4213/dm1515 (Mi dm1515) 		 
This article is cited in 3 scientific papers (total in 3 papers)

Trees without twin-leaves with smallest number of maximal independent sets

D. S. Taletskiia, D. S. Malyshevb

a Lobachevski State University of Nizhni Novgorod
b National Research University "Higher School of Economics", Nizhny Novgorod Branch
Full-text PDF (277 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1515
Abstract: For any $n$, in the set of $n$-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.
Keywords: extremal combinatorics, tree, maximal independent set.
Funding agency Grant number
Russian Foundation for Basic Research 18-31-20001-мол-а-вед
Received: 04.04.2018
Revised: 31.08.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 1, Pages 53–67
DOI: https://doi.org/10.1515/dma-2020-0006
Bibliographic databases:
Document Type: Article
UDC: 519.172.1
Language: Russian
Citation: D. S. Taletskii, D. S. Malyshev, “Trees without twin-leaves with smallest number of maximal independent sets”, Diskr. Mat., 30:4 (2018), 115–133; Discrete Math. Appl., 30:1 (2020), 53–67
Citation in format AMSBIB
\Bibitem{TalMal18}
\by D.~S.~Taletskii, D.~S.~Malyshev
\paper Trees without twin-leaves with smallest number of maximal independent sets
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 4
\pages 115--133
\mathnet{http://mi.mathnet.ru/dm1515}
\crossref{https://doi.org/10.4213/dm1515}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3884633}
\elib{https://elibrary.ru/item.asp?id=36447997}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 1
\pages 53--67
\crossref{https://doi.org/10.1515/dma-2020-0006}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000513931900005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85080928613}
Linking options:
  • https://www.mathnet.ru/eng/dm1515
  • https://doi.org/10.4213/dm1515
  • https://www.mathnet.ru/eng/dm/v30/i4/p115
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:403
    Full-text PDF :67
    References:40
    First page:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024