论文标题
签名书图的色度一项
Chromatic Polynomials of Signed Book Graphs
论文作者
论文摘要
对于$ m \ geq 3 $和$ n \ geq 1 $，$ m $ - 循环图$ b（m，n）$由$ n $副本$ n $副本$ c_m $，带有一个共同的边缘。 In this paper, we prove that (a) the number of switching non-isomorphic signed $B(m,n)$ is $n+1$, and (b) the chromatic number of a signed $B(m,n)$ is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.
For $m \geq 3$ and $n \geq 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 switching non-isomorphic signed $B(m,n)$ is $n+1$, and (b) the chromatic number of a signed $B(m,n)$ is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.
