Signed Chromatic Polynomials of Signed Book Graphs
From MaRDI portal
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.
This page was built for publication: Signed 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 Q6311410)
