On independent sets in the class graph of a finite group

被引：11
|
作者：
Dolfi, Silvio [1 ]
机构：
[1] Univ Florence, Dipartimento Matemat U Dini, I-50134 Florence, Italy
来源：
JOURNAL OF ALGEBRA | 2006年 / 303卷 / 01期
关键词：
D O I：
10.1016/j.jalgebra.2005.09.006
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that in the class graph of a finite group there is no independent set of three vertices. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：216 / 224
页数：9
相关论文
共 50 条
  • [11] On the number of maximal independent sets in a graph
    Wood, David R.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (03): : 17 - 19
  • [12] Problems on matchings and independent sets of a graph
    Bhattacharya, Amitava
    Mondal, Anupam
    Murthy, T. Srinivasa
    DISCRETE MATHEMATICS, 2018, 341 (06) : 1561 - 1572
  • [13] Critical and maximum independent sets of a graph
    Jarden, Adi
    Levit, Vadim E.
    Mandrescu, Eugen
    DISCRETE APPLIED MATHEMATICS, 2018, 247 : 127 - 134
  • [14] The number of independent sets in a grid graph
    Calkin, NJ
    Wilf, HS
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 54 - 60
  • [15] Counting independent sets in a tolerance graph
    Lin, Min-Sheng
    Su, Sheng-Huang
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 174 - 184
  • [16] On the star of the family of independent sets in a graph
    Zhang, Huihui
    Ran, Yifei
    Huang, Jing
    DISCRETE APPLIED MATHEMATICS, 2024, 344 : 170 - 178
  • [17] Computing transparently: the independent sets in a graph
    Head, Tom
    NATURAL COMPUTING, 2011, 10 (01) : 129 - 138
  • [18] The number of independent sets in an irregular graph
    Sah, Ashwin
    Sawhney, Mehtaab
    Stoner, David
    Zhao, Yufei
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 138 : 172 - 195
  • [19] Toggling independent sets of a path graph
    Joseph, Michael
    Roby, Tom
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
  • [20] ON MINIMUM MAXIMAL INDEPENDENT SETS OF A GRAPH
    HAVILAND, J
    DISCRETE MATHEMATICS, 1991, 94 (02) : 95 - 101
12345