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
Highlights
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
Summary
Untuk graf identik dengan graf bintang dengan banyaknya titik adalah 4 dan terdapat satu titik berderajat 3 serta 3 titik berderajat 1. Oleh karena itu jumlah warna minimum yang bisa diterapkan adalah 2. Teorema 1 maka diperoleh graf dapat diwarnai dengan dua warna. Teorema Vizing tersebut digunakan dalam pembuktian teorema mengenai pewarnaan sisi pada graf Untuk graf hanya terdiri atas satu titik dan tidak mempunyai sisi. Bilangan kromatik pada pewarnaan sisi graf adalah nol
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Jurnal Ilmiah Matematika dan Pendidikan Matematika
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
