Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal KADIKMA
Ika Nur Maylisa
Universitas Jember
Mathematics

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

Found 1 Documents
Search

 1 
KETERAMPILAN BERPIKIR TINGKAT TINGGI DALAM PEWARNAAN SISI r-DINAMIS PADA GRAF KHUSUS Ika Nur Maylisa; Dafik Dafik; Susi Setiawani
KadikmA Vol 6 No 3 (2015): Desember 2015
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v6i3.5218

Abstract

Abstract. Edge coloring -dynamic of a graph is a map , where , such that no two adjacent edges receive the same colors. An edge -dynamic -coloring is a proper -colouring of such that for each edge in , where is the neighborhood of and are the degree of while for a edge subset . The edge -dynamic chromatic number written as , is the minimum such that has an edge -dynamic -coloring. In this research develop edge coloring -dynamic on special graph, specially on graph, lobster graph, butterfly graph, diamond graph, friendship graph and star graph. The result from this research is a theorem that indicated minimum color for a graph G in topic “edge coloring -dynamic” and how the link between edge coloring with Higher Order Thinking Skill (HOTS). Keywords: edge coloring, -dynamic, chromatic number, HOTS
Co-Authors D. Dafik Susi Setiawani