Chromatic Polynomials of Signed Book Graphs

Deepak Sehrawat, Bikash Bhattacharjya

For $m\ge 3$ and $n\ge 1$, the $m$-cycle book graph $B(m,n)$ consists of $n$ copies of the cycle $C_m$ with one common edge. In this paper, we prove that (a) the number of swit…