• Corpus ID: 119662278

Signed Chromatic Polynomials of Signed Book Graphs

  title={Signed Chromatic Polynomials of Signed Book Graphs},
  author={Deepak and Bikash Bhattacharjya},
  journal={arXiv: Combinatorics},
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. 
1 Citations

Figures from this paper

Maximum Frustration in Signed Generalized Petersen Graphs
This paper proves that the maximum frustration of generalized Petersen graphs $P_{n,k}$ is bounded above by $\left\lfloor \frac{n}{2} \right\rfloor + 1$ for $\gcd( n,k)=1$ and this bound is achieved for $k=1,2,3$.


Signed graph coloring
Unlabeled signed graph coloring
  • Brian Davis
  • Mathematics
    Rocky Mountain Journal of Mathematics
  • 2019
We extend the work of Hanlon on the chromatic polynomial of an unlabeled graph to define the unlabeled chromatic polynomial of an unlabeled signed graph. Explicit formulas are presented for labeled
The chromatic polynomials of signed Petersen graphs
Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by showing that the latter
Six signed Petersen graphs, and their automorphisms
Inside-out polytopes
Signed graphs
  • E. and Sopena, E.
  • 2015
And M
  • Young, The Chromatic Polynomials of Signed Petersen Graphs, Involve 8
  • 2015
Seven signings of the Heawood graph
  • Phd Thesis, The Ohio State University
  • 2012