This paper presents results on the chromatic polynomials of             some graphs. In particular, the chromatic polynomials of n-centipede            and triangular snake  graphs are obtained. Interestingly, the chromatic polynomial of n-centipede is an alternating series involving binomial coefficients. As a consequence, the chromatic number  of every graph G considered in this paper is obtained.

chromatic number, chromatic polynomial, coloring.

Received: October 3, 2022; Accepted: November 8, 2022; Published: November 28, 2022

How to cite this article: Wilma S. Ismael, Hounam B. Copel and Sisteta U. Kamdon, Chromatic polynomials of n-centipede and triangular snake TS_n graphs, Advances and Applications in Discrete Mathematics 36 (2023), 1-9. http://dx.doi.org/10.17654/0974165823001

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] G. D. Birkhoff, A determinant formula for the number of ways of coloring a map, The Annals of Mathematics Second Series 14(1/4) (1912-1913), 42-46.
[2] F. M. Dong, K. M. Koh and K. L. Teo, Chromatic Polynomials and Chromaticity of Graphs, 2004.
[3] F. M. Dong, Chromatic Polynomials and Chromaticity of Graphs, Illustrated edition, June 2005.
[4] C. Fouts, The Chromatic Polynomial, 2009.
[5] F. Harary, Graph Theory, Addison-Wesley Publishing Company, Inc., USA, 1969.
[6] Tamas Hubai, The Chromatic Polynomial, 2009.
[7] Ronald C. Read, An introduction to chromatic polynomials, Department of Mathematics, University of the West Indies, Kingston, Jamaica, Communicated by Frank Harary, Journal of Combinatorial Theory 4 (1968), 52-71.
[8] R. C. Read and W. T. Tutte, Chromatic polynomials, Selected Topics in Graph Theory 3 (1988), 15-42.
[9] B. R. Srinivas and A. Sri Krishna Chaitanya, The chromatic polynomials and its algebraic properties, International Journal of Scientific and Innovative Mathematical Research (IJSIMR) 2(11) (2014), 914-922.
[10] R. J. Wilson, Introduction to Graph Theory, Prentice Hall, New York, 1996.