The cardinality of the collection of maximum independent sets of a functional graph

被引：5
|
作者：
Chang, SC [1 ]
Yeh, YN [1 ]
机构：
[1] ACAD SINICA,INST MATH,TAIPEI,TAIWAN
来源：
ADVANCES IN APPLIED MATHEMATICS | 1997年 / 18卷 / 03期
关键词：
D O I：
10.1006/aama.1996.0509
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
An independent set (or stable set) of a graph G(V, E) is a subset S of the vertices set V in which no two are adjacent. Let psi(G) be the number of vertices in a stable set of maximum cardinality; psi(G) is called the stability number of G. Stability numbers of a graph have been well studied, but little has been done on the number of independent subsets whose cardinality is the stability number. In this paper we will provide an algorithm to find the number of independent subsets whose cardinality is the stability number. (C) 1997 Academic Press.
引用
收藏
页码：286 / 299
页数：14
相关论文
共 50 条
  • [1] Critical and maximum independent sets of a graph
    Jarden, Adi
    Levit, Vadim E.
    Mandrescu, Eugen
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 247 : 127 - 134
  • [2] Designs associated with maximum independent sets of a graph
    Walikar, H. B.
    Acharya, B. D.
    Shirkol, Shailaja S.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2010, 57 (01) : 91 - 105
  • [3] Designs associated with maximum independent sets of a graph
    H. B. Walikar
    B. D. Acharya
    Shailaja S. Shirkol
    [J]. Designs, Codes and Cryptography, 2010, 57 : 91 - 105
  • [4] The Number of Independent Sets in a Graph with Small Maximum Degree
    David Galvin
    Yufei Zhao
    [J]. Graphs and Combinatorics, 2011, 27 : 177 - 186
  • [5] Monotonic Properties of Collections of Maximum Independent Sets of a Graph
    Adi Jarden
    Vadim E. Levit
    Eugen Mandrescu
    [J]. Order, 2019, 36 : 199 - 207
  • [6] The Number of Independent Sets in a Graph with Small Maximum Degree
    Galvin, David
    Zhao, Yufei
    [J]. GRAPHS AND COMBINATORICS, 2011, 27 (02) : 177 - 186
  • [7] Monotonic Properties of Collections of Maximum Independent Sets of a Graph
    Jarden, Adi
    Levit, Vadim E.
    Mandrescu, Eugen
    [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2019, 36 (02): : 199 - 207
  • [8] Graph polynomials, principal pivoting, and maximum independent sets
    Glantz, R
    Pelillo, M
    [J]. GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2726 : 166 - 177
  • [9] GENERATION OF MAXIMUM INDEPENDENT SETS OF A BIPARTITE GRAPH AND MAXIMUM CLIQUES OF A CIRCULAR-ARC GRAPH
    KASHIWABARA, T
    MASUDA, S
    NAKAJIMA, K
    FUJISAWA, T
    [J]. JOURNAL OF ALGORITHMS, 1992, 13 (01) : 161 - 174
  • [10] On the cardinality of positively linearly independent sets
    W. Hare
    H. Song
    [J]. Optimization Letters, 2016, 10 : 649 - 654
12345