Independence equivalence classes of cycles |
| |
Institution: | Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616, Singapore |
| |
Abstract: | 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. |
| |
Keywords: | Independence polynomial Independence equivalence |
本文献已被 ScienceDirect 等数据库收录! |
|