Independence equivalence classes of cycles
Combinatorics
2022-08-16 v2
Abstract
The independence equivalence class of a graph is the set of graphs that have the same independence polynomial as . Beaton, Brown and Cameron (arXiv:1810.05317) 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
Cite
@article{arxiv.2104.10080,
title = {Independence equivalence classes of cycles},
author = {Boon Leong Ng},
journal= {arXiv preprint arXiv:2104.10080},
year = {2022}
}