On Trees with a Given Diameter and the Extremal Number of Distance-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document} Independent Sets

被引：0
作者：
D. S. Taletskii
机构：
[1] National Research University Higher School of Economics,
[2] Nizhny Novgorod Branch,undefined
[3] Lobachevsky State University of Nizhny Novgorod,undefined
来源：
Journal of Applied and Industrial Mathematics | 2023年 / 17卷 / 3期
关键词：
tree; independent set; distance-; independent set; diameter;
D O I：
10.1134/S1990478923030195
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：664 / 677
页数：13
相关论文
共 22 条
[1]  
Pedersen A.S.(2007)An upper bound on the number of independent sets in a tree Ars Combinatoria 84 85-96
[2]  
Vestergaard P.D.(2013)Merrifield-Simmons index and minimum number of independent sets in short trees Ars Combinatoria 111 85-95
[3]  
Frendrup A.(2010)On the number of independent sets in the trees of a fixed diameter J. Appl. Ind. Math. 4 163-171
[4]  
Pedersen A.S.(2021)Trees of diameter Math. Notes. 109 280-291
[5]  
Sapozhenko A.A.(2004) and Comb. Probab. Comput. 13 295-309
[6]  
Vestergaard P.D.(2016) with minimum number of independent sets Linear Algebra Appl. 510 160-170
[7]  
Dainiak A.B.(2014)On the Australas. J. Comb. 59 311-322
[8]  
Taletskii D.S.(2020)-independence number of sparse random graphs Graphs Comb. 37 393-408
[9]  
Atkinson G.(2021)Spectral bounds for the Appl. Math. Comput. 409 126412-238
[10]  
Frieze A.(2018)-independence number of a graph Int. J. Contemp. Math. Sci. 13 231-undefined
123