Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi
Maylisa, Ika Nur
Unknown Affiliation
Mathematics

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

Found 2 Documents
Search

 1 
KETERAMPILAN BERPIKIR TINGKAT TINGGI DALAM PEWARNAAN SISI r-DINAMIS PADA GRAF KHUSUS Maylisa, Ika Nur; Dafik, Dafik; Setiawani, Susi
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
On Local Antimagic b-Coloring and Its Application for STGNN Time Series Forecasting on Horizontal Farming Sunder, R.; Agustin, Ika Hesti; Dafik, Dafik; Maylisa, Ika Nur; Mohanapriya, N.; Marsidi, Marsidi
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 10, No 1 (2025): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v10i1.29968

Abstract

This article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of  as  where  is the set of edges incident to . The bijection  is said to be a local antimagic labeling if for any two adjacent vertices, their vertex weights must be distinct. Furthermore  a coloring of a graph is a proper coloring of the vertices of  such that in each color class there exists a vertex having neighbors in all other  color classes. If we assign color on each vertex by the vertex weight  such that it induces a graph coloring satisfying coloring property, then this concept falls into a local antimagic coloring of graph. A local antimagic chromatic number, denoted by , is the maximum number of colors chosen for any colorings generated by local antimagic coloring of . In this paper we initiate to explore some new lemmas or theorems regarding to . Furthermore, to see the robust application of local antimagic coloring, at the end of this paper we will analyse the implementation of local antimagic coloring on Graph Neural Networks (GNN) multi-step time series forecasting on for NPK (Nitrogen, Phosphorus, and Potassium) concentration of companion plantations.
Co-Authors D. Dafik Ika Hesti Agustin, Ika Hesti Mohanapriya, N. Sunder, R. Susi Setiawani