Searcharxiv⌕ Search

arXiv subjects

Boon Leong Ng

Publications and source records attributed to Boon Leong Ng.

2 recordsLinked to original sources
arXiv2022

Independence equivalence classes of paths

The independence equivalence class of a graph $G$ is the set of graphs that have the same independence polynomial as $G$. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton, Brown and Cameron (2019) showed that paths with an odd number of vertices are independence unique and raised the problem of finding the independence equivalence class of paths with an even number of vertices. The problem is completely solved in this paper.

math.CO↗
arXiv2021

Independence equivalence classes of cycles

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.

math.CO↗