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.
机构:
Nanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China
MIIT Key Lab Math Modelling & High Performance Com, Nanjing, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China
Luo, Zuwen
Xu, Kexiang
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China
MIIT Key Lab Math Modelling & High Performance Com, Nanjing, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China
Xu, Kexiang
Cevik, Ahmet Sinan
论文数: 0引用数: 0
h-index: 0
机构:
Konya Selcuk Univ, Fac Sci, Dept Math, Konya, TurkiyeNanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China
Cevik, Ahmet Sinan
Gutman, Ivan
论文数: 0引用数: 0
h-index: 0
机构:
Univ Kragujevac, Fac Sci, Kragujevac, SerbiaNanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing, Peoples R China