Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Siti Khabibah
Departemen Matematika, FSM Undip
Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)

 1 
PEWARNAAN PADA GRAF BINTANG SIERPINSKI Siti Khabibah
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 9 No 1 (2017): Jurnal Ilmiah Matematika dan Pendidikan Matematika
Publisher : Jurusan Matematika FMIPA Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2017.9.1.2853

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
PEWARNAAN PADA GRAF BINTANG SIERPINSKI Siti Khabibah
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Vol 9 No 1 (2017): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2017.9.1.2853

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
Co-Authors