Polinomial Kromatik Graf Bunga

  • Risang Narendra Universitas Nahdlatul Ulama Blitar
Keywords: Chromatic polynomial, flower graph

Abstract

In this study, the class of a graph called Flower Graph was discussed. Flower Graph is a special way in a graphic. A graph G is called a flower chart-. This graph will be symbolized by . Then, it is defined by a flower chart-, with the petal to which  in a flower graph-, by -petal removed, for . Flower graphics-: with petal as much as  is denoted by .

Chromatic polynomial  is the amount of forms to color the point in graph G with  color, where there are no two points that fit to obtain the same color. In the end, using the reduction theorem, the chromatic polynomial theorem of the Sikel chart and the chromatic polynomial graphic of the chromatic polynomial tree of a flower chart obtained.

References

Budayasa, ketut. 2007. Teori graph dan aplikasinya. Surabaya : unesa university press Surabaya.
[2] Budayasa, ketut. 2008. Matematika Diskrit. Surabaya : unesa university press Surabaya.
[3] Johnsonbaugh, Richard. 2007. Matematika diskrit. Surabaya: PT.Prenhallindo
[4] Duval, Art. 2005. An Example of Induction: Chromatic Polynomials. http://www.math.utep.edu/Faculty/duval/class/2325/084/chrpoly.pdf, diakses Selasa, 3 Juli 2012, pukul 06.21 WIB)
[5] Mphako-Banda, Eunice. 2007. Some Polynomials of Flower Graphs http://www.m-hikari.com/imf-password2007/49-52-2007/bandaIMF49-52-2007.pdf diakses Selasa, 3 Juli 2012, pukul 17.39 WIB)
Published
2022-12-31
How to Cite
Narendra, R. (2022). Polinomial Kromatik Graf Bunga. UJMC (Unisda Journal of Mathematics and Computer Science), 8(2), 55-58. https://doi.org/https://doi.org/10.52166/ujmc.v8i2.3713