Signed Chromatic Polynomials of Signed Book Graphs
Combinatorics
2018-12-21 v1
Abstract
In 2015, Matthias Beck and his team developed a computer program in SAGE which efficiently determines the number of signed proper -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.
Keywords
Cite
@article{arxiv.1812.08382,
title = {Signed Chromatic Polynomials of Signed Book Graphs},
author = {Deepak and Bikash Bhattacharjya},
journal= {arXiv preprint arXiv:1812.08382},
year = {2018}
}
Comments
17 Pages