The second largest number of maximal independent sets in twinkle graphs

被引：0

作者：

Lin, Jenq-Jong ^{[1
]}

Jou, Min-Jen ^{[1
]}

机构：

[1] Ling Tung University, Taichung,40852, Taiwan

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2020年 / 113卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper, we determine the second largest number of maximal independent sets and characterize those extremal graphs achieving these values among all twinkle graphs. © 2020 Charles Babbage Research Centre. All rights reserved.

引用

页码：31 / 48