ON THE NUMBER OF INDEPENDENT SETS OF NODES IN A TREE

被引：0
|
作者：
DUTTON, R
CHANDRASEKHARAN, N
BRIGHAM, R
机构：
[1] UNIV CENT FLORIDA,DEPT COMP SCI,ORLANDO,FL 32816
[2] UNIV CENT FLORIDA,DEPT MATH,ORLANDO,FL 32816
来源：
FIBONACCI QUARTERLY | 1993年 / 31卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：98 / 104
页数：7
相关论文
共 50 条
  • [41] Upper bound for the number of independent sets in graphs
    A. A. Sapozhenko
    Doklady Mathematics, 2007, 75 : 447 - 448
  • [42] CONNECTED GRAPHS WITH A LARGE NUMBER OF INDEPENDENT SETS
    Jou, Min-Jen
    TAIWANESE JOURNAL OF MATHEMATICS, 2013, 17 (06): : 2011 - 2017
  • [43] On the number of independent sets in the trees of a fixed diameter
    Dainyak A.B.
    Journal of Applied and Industrial Mathematics, 2010, 4 (2) : 163 - 171
  • [44] The Number of Maximal Independent Sets in the Hamming Cube
    Jeff Kahn
    Jinyoung Park
    Combinatorica, 2022, 42 : 853 - 880
  • [45] THE NUMBER OF MAXIMAL INDEPENDENT SETS IN CONNECTED GRAPHS
    FUREDI, Z
    JOURNAL OF GRAPH THEORY, 1987, 11 (04) : 463 - 470
  • [46] The number of independent sets in bipartite graphs and benzenoids
    Han, Michael
    Herlihy, Sycamore
    Kuenzel, Kirsti
    Martin, Daniel
    Schmidt, Rachel
    AEQUATIONES MATHEMATICAE, 2024,
  • [47] Bounds on the number of vertex independent sets in a graph
    Pedersen, Anders Sune
    Vestergaard, Preben Dahl
    TAIWANESE JOURNAL OF MATHEMATICS, 2006, 10 (06): : 1575 - 1587
  • [48] ON THE NUMBER OF MAXIMUM INDEPENDENT SETS IN DOOB GRAPHS
    Krotov, D. S.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2015, 12 : 508 - 512
  • [49] Maximizing the Number of Independent Sets of a Fixed Size
    Gan, Wenying
    Loh, Po-Shen
    Sudakov, Benny
    COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (03): : 521 - 527
  • [50] Decision tree induction with a constrained number of leaf nodes
    Chia-Chi Wu
    Yen-Liang Chen
    Yi-Hung Liu
    Xiang-Yu Yang
    Applied Intelligence, 2016, 45 : 673 - 685
12345