Independence equivalence classes of cycles

被引:1
|
作者
Ng, Boon Leong [1 ]
机构
[1] Nanyang Technol Univ, Natl Inst Educ, Math & Math Educ, 1 Nanyang Walk, Singapore 637616, Singapore
关键词
Independence polynomial; Independence equivalence;
D O I
10.1016/j.disc.2021.112605
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The independence equivalence class of a graph G is the set of graphs that have the same independence polynomial as G. Beaton, Brown and Cameron(2019) found the independence equivalence classes of even cycles, and raised the problem of finding the independence equivalence class of odd cycles. The problem is completely solved in this paper. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 50 条