Signed Chromatic Polynomials of Signed Book Graphs
classification
🧮 math.CO
keywords
signedbookchromaticgraphgraphsnumberpolynomialsarticle
read the original abstract
In 2015, Matthias Beck and his team developed a computer program in SAGE which efficiently determines the number of signed proper $k$-colorings for a given signed graph. In this article, we determine the number of different signatures on Book graph up to switching isomorphisms. We also find a recursive formula of the signed chromatic polynomials of signed Book graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.