Signed Chromatic Polynomials of Signed Book Graphs

2018/12/20 by Bikash Bhattacharjya, Deepak, Bhattacharjya, Bikash
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1812.08382

openalex publication_date 2018/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The chromatic number of a signed graph
• Unlabeled Signed Graph Coloring
• Chromatic polynomials of signed graphs and dominating-vertex deletion formulae
• Acyclic Orientations and the Chromatic Polynomial of Signed Graphs
• On the signed chromatic number of some classes of graphs