Involve: A Journal of Mathematics
- Volume 8, Number 5 (2015), 825-831.
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 can be told apart by their chromatic polynomials, by showing that the latter give distinct results when evaluated at 3. He conjectured that the six different signed Petersen graphs also have distinct zero-free chromatic polynomials, and that both types of chromatic polynomials have distinct evaluations at any positive integer. We developed and executed a computer program (running in SAGE) that efficiently determines the number of proper -colorings for a given signed graph; our computations for the signed Petersen graphs confirm Zaslavsky’s conjecture. We also computed the chromatic polynomials of all signed complete graphs with up to five vertices.
Involve, Volume 8, Number 5 (2015), 825-831.
Received: 18 April 2014
Revised: 18 December 2014
Accepted: 13 January 2015
First available in Project Euclid: 22 November 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Beck, Matthias; Meza, Erika; Nevarez, Bryan; Shine, Alana; Young, Michael. The chromatic polynomials of signed Petersen graphs. Involve 8 (2015), no. 5, 825--831. doi:10.2140/involve.2015.8.825. https://projecteuclid.org/euclid.involve/1511370951
- Sage code for computing chromatic polynomials of signed graphs.