Upper bound for the number of independent sets in graphs

被引：0

|

作者：

A. A. Sapozhenko

机构：

[1] Moscow State University,Faculty of Computational Mathematics and Cybernetics

来源：

Doklady Mathematics | 2007年 / 75卷

关键词：

Regular Graph; DOKLADY Mathematic; Leninskie Gory; Complete Bipartite Graph; Independence Number;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：447 / 448

页数：1

相关论文

共 50 条

[1] Upper bound for the number of independent sets in graphs
Sapozhenko, A. A.
DOKLADY MATHEMATICS, 2007, 75 (03) : 447 - 448
[2] An upper bound for the number of independent sets in regular graphs
Galvin, David
DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6635 - 6640
[3] An upper bound on the number of independent sets in a tree
Pedersen, Anders Sune
Vestergaard, Preben Dahl
ARS COMBINATORIA, 2007, 84 : 85 - 96
[4] An upper bound for the number of maximal independent sets in a graph
Alekseev, V. E.
DISCRETE MATHEMATICS AND APPLICATIONS, 2007, 17 (04): : 355 - 359
[5] The Number of Independent Sets in Graphs
Sapozhenko, A. A.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2007, 62 (03) : 116 - 118
[6] A sharp upper bound for the number of stable sets in graphs with given number of cut edges
Hua, Hongbo
APPLIED MATHEMATICS LETTERS, 2009, 22 (09) : 1380 - 1385
[7] The Number of Independent Sets In Hexagonal Graphs
Deng, Zhun
Ding, Jie
Heal, Kathryn
Tarokh, Vahid
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2910 - 2914
[8] The number of independent sets in unicyclic graphs
Pedersen, AS
Vestergaard, PD
DISCRETE APPLIED MATHEMATICS, 2005, 152 (1-3) : 246 - 256
[9] ON THE NUMBER OF MAXIMUM INDEPENDENT SETS OF GRAPHS
Derikvand, T.
Oboudi, M. R.
TRANSACTIONS ON COMBINATORICS, 2014, 3 (01) : 29 - 36
[10] The number of independent sets in bicyclic graphs
Jing, Wei
Li, Shuchao
ARS COMBINATORIA, 2013, 108 : 465 - 479

← 1 2 3 4 5 →