PEWARNAAN PADA GRAF BINTANG SIERPINSKI
Abstract
This paper discuss about Sierpinski star graph , which its construction based on the Sierpinski triangle. Vertex set of Sierpinski star graph is a set of all triangles in Sierpinski triangle; and the edge set of Sierpinski star graph is a set of all sides that are joint edges of two triangles on Sierpinski triangle. From the vertex and edge coloring of Sierpinski star graph, it is found that the chromatic number on vertex coloring of graph is 1 for n = 1 and 2 for ; while the chromatic number on edge coloring of graf is 0 for n = 1 and for
Published
2017-06-23
How to Cite
KHABIBAH, Siti.
PEWARNAAN PADA GRAF BINTANG SIERPINSKI.
Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 9, n. 1, p. 37-44, june 2017.
ISSN 2550-0422.
Available at: <https://jos.unsoed.ac.id/index.php/jmp/article/view/2853>. Date accessed: 19 apr. 2026.
doi: https://doi.org/10.20884/1.jmp.2017.9.1.2853.
Section
Articles
Each article is copyrighted © by its author(s) and licensed under CC BY-NC-ND License.
