Independence equivalence classes of cycles

Boon Leong Ng

doi:10.1016/j.disc.2021.112605

paper

Independence equivalence classes of cycles

arXiv:2104.10080 · doi:10.1016/j.disc.2021.112605

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 (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.

References in corpus (1)

The Domination Equivalence Classes of Paths

Cited by in corpus (1)

Independence equivalence classes of paths