The numbers of maximal independent sets in connected unicyclic graphs

被引:0
|
作者
Lin, Jenq-Jong [1 ]
Jou, Min-Jen [1 ]
机构
[1] Ling Tung Univ, Taichung 40852, Taiwan
关键词
TRIANGLE-FREE GRAPHS; TREE;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A maximal independent set is an independent set that is not a proper subset of any other independent set. A graph is said to be unicyclic if it contains exactly one cycle. In this paper, we determine the first three largest numbers of maximal independent sets and characterize those extremal graphs achieving these values among all connected unicyclic graphs. Using these results, the problem for the third largest number of maximal independent sets among all (connected) graphs with at most one cycle is also resolved.
引用
收藏
页码:215 / 225
页数:11
相关论文
共 50 条
  • [1] The maximum number of maximal independent sets in unicyclic connected graphs
    Koh, K. M.
    Goh, C. Y.
    Dong, F. M.
    DISCRETE MATHEMATICS, 2008, 308 (17) : 3761 - 3769
  • [2] THE NUMBER OF MAXIMAL INDEPENDENT SETS IN CONNECTED GRAPHS
    FUREDI, Z
    JOURNAL OF GRAPH THEORY, 1987, 11 (04) : 463 - 470
  • [3] The largest number of maximal independent sets in quasi-unicyclic graphs
    Lin, Jenq-Jong
    Jou, Min-Jen
    UTILITAS MATHEMATICA, 2019, 111 : 85 - 93
  • [4] The number of independent sets in unicyclic graphs
    Pedersen, AS
    Vestergaard, PD
    DISCRETE APPLIED MATHEMATICS, 2005, 152 (1-3) : 246 - 256
  • [5] The number of maximal dissociation sets in unicyclic graphs
    Jin, Long
    Li, Jianxi
    Shiu, Wai Chee
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024,
  • [6] Minimum connected dominating sets and maximal independent sets in unit disk graphs
    Wu, WL
    Du, HW
    Jia, XH
    Li, YS
    Huang, SCH
    THEORETICAL COMPUTER SCIENCE, 2006, 352 (1-3) : 1 - 7
  • [7] The average size of independent sets in unicyclic graphs
    Luo, Zuwen
    Xu, Kexiang
    Cevik, Ahmet Sinan
    Gutman, Ivan
    CONTRIBUTIONS TO MATHEMATICS, 2023, 7 : 1 - 10
  • [8] The number of maximal independent sets in connected triangle-free graphs
    Chang, GJ
    Jou, MJ
    DISCRETE MATHEMATICS, 1999, 197 (1-3) : 169 - 178
  • [9] The number of maximal independent sets in connected triangle-free graphs
    Chang, Gerard J.
    Jou, Min-Jen
    Discrete Mathematics, 1999, 197-198 : 169 - 178
  • [10] Generalized Padovan numbers, Perrin numbers and maximal k-independent sets in graphs
    Wloch, Iwona
    Wloch, Andrzej
    ARS COMBINATORIA, 2011, 99 : 359 - 364