Chromatic polynomials of signed book graphs

DOI10.20429/TAG.2022.090104MaRDI QIDQ5071286zbMATH OpenOpenAlexFDO

Authors Deepak Sehrawat, Bikash Bhattacharjya

Publication date 20 April 2022

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2206.08580

zbMATH Keywords

\(m\)-cycle book graphzero-free chromatic polynomials

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph polynomials (05C31)

Abstract: For $mgeq3$ and $ngeq1$, 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.

Recommendations

• How colorful the signed graph?
• The chromatic polynomials of signed Petersen graphs
• The chromatic spectrum of signed graphs
• The odd-valued chromatic polynomial of a signed graph
• A bivariate chromatic polynomial for signed graphs

Cited in

(1)

• The chromatic polynomials of signed Petersen graphs

This page was built for publication: Chromatic polynomials of signed book graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071286)