RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskr. Mat., 2018, Volume 30, Issue 4, Pages 115–133 (Mi dm1515)  

Trees without twin-leaves with a minimum 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

Abstract: In this paper, for any $n$, we completely describe trees with a minimum number of maximal independent sets among $n$-vertex trees, not containing two leaves, adjacent to a common vertex.

Keywords: extremal combinatorics, tree, maximal independent set.

Funding Agency Grant Number
Russian Foundation for Basic Research 18-31-20001-мол-а-вед


DOI: https://doi.org/10.4213/dm1515

Full text: PDF file (277 kB)
First page: PDF file
References: PDF file   HTML file

Document Type: Article
UDC: 519.172.1
Received: 04.04.2018
Revised: 31.08.2018

Citation: D. S. Taletskii, D. S. Malyshev, “Trees without twin-leaves with a minimum number of maximal independent sets”, Diskr. Mat., 30:4 (2018), 115–133

Citation in format AMSBIB
\Bibitem{TalMal18}
\by D.~S.~Taletskii, D.~S.~Malyshev
\paper Trees without twin-leaves with a minimum 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}
\elib{http://elibrary.ru/item.asp?id=36447997}


Linking options:
  • http://mi.mathnet.ru/eng/dm1515
  • https://doi.org/10.4213/dm1515
  • http://mi.mathnet.ru/eng/dm/v30/i4/p115

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретная математика
    Number of views:
    This page:39
    References:3
    First page:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019