Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Taletskii, Dmitrii Sergeevich

Statistics Math-Net.Ru
Total publications: 12
Scientific articles: 12

Number of views:
This page:206
Abstract pages:2313
Full texts:476
References:287
Scientific Employee
Candidate of physico-mathematical sciences

https://www.mathnet.ru/eng/person123109
List of publications on Google Scholar
List of publications on ZentralBlatt
https://orcid.org/0000-0003-0966-3903

Publications in Math-Net.Ru Citations
2024
1. D. S. Taletskii, “On the number of $k$-dominating independent sets in planar graphs”, Diskretn. Anal. Issled. Oper., 31:1 (2024),  109–128  mathnet; J. Appl. Industr. Math., 18:1 (2024), 167–178
2023
2. D. S. Taletskii, “On trees with given diameter and extremal number of distance-$k$ independent sets”, Diskretn. Anal. Issled. Oper., 30:3 (2023),  111–131  mathnet
3. D. S. Taletskii, “On the number of minimum total dominating sets in trees”, Diskretn. Anal. Issled. Oper., 30:1 (2023),  110–129  mathnet  mathscinet
4. D. S. Taletskii, “On the Number of Minimum Dominating Sets in Trees”, Mat. Zametki, 113:4 (2023),  577–595  mathnet  mathscinet; Math. Notes, 113:4 (2023), 552–566  scopus
5. D. S. Taletskii, “On the number of independent and $k$-dominating sets in graphs with average vertex degree at most $k$”, Mat. Sb., 214:11 (2023),  133–156  mathnet  mathscinet; Sb. Math., 214:11 (2023), 1627–1650  isi  scopus
2021
6. D. S. Taletskii, “Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets”, Mat. Zametki, 109:2 (2021),  276–289  mathnet  mathscinet; Math. Notes, 109:2 (2021), 280–291  isi 2
2020
7. 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  mathnet  mathscinet  elib; Discrete Math. Appl., 31:2 (2021), 135–144  isi  scopus
2018
8. D. S. Taletskii, D. S. Malyshev, “On trees of bounded degree with maximal number of greatest independent sets”, Diskretn. Anal. Issled. Oper., 25:2 (2018),  101–123  mathnet  elib; J. Appl. Industr. Math., 12:2 (2018), 369–381  scopus 3
9. D. S. Taletskii, D. S. Malyshev, “Trees without twin-leaves with smallest number of maximal independent sets”, Diskr. Mat., 30:4 (2018),  115–133  mathnet  mathscinet  elib; Discrete Math. Appl., 30:1 (2020), 53–67  isi  scopus 3
10. D. S. Taletskii, “On properties of solution of a reccurent equation appearing in enumeration of maximal independent sets in complete trees”, Zhurnal SVMO, 20:1 (2018),  46–54  mathnet  elib 1
2017
11. D. S. Taletskii, “On generating functions and limit theorems connected with maximal independent sets in grid graphs”, Zhurnal SVMO, 19:2 (2017),  105–116  mathnet  elib
2016
12. D. S. Taletskii, D. S. Malyshev, “On the number of maximal independent sets in complete $q$-ary trees”, Diskr. Mat., 28:4 (2016),  139–149  mathnet  mathscinet  elib; Discrete Math. Appl., 27:5 (2017), 311–318  isi  scopus 3

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024