Article Per Year (5 Year)
p-Index From 2020 - 2025
1.376
P-Index
This Author published in this journals
All Journal InPrime: Indonesian Journal Of Pure And Applied Mathematics Jurnal Ilmiah Matematika Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi MATHunesa: Jurnal Ilmiah Matematika Smart Society: Community Service and Empowerment Journal Indonesian Journal of Applied Mathematics
Christyan Tamaro Nadeak
Data Science Study Program, Sumatra Institute Of Technology
Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Languange, Linguistic, Communication & Media Mathematics Physics Social Sciences Other

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

Found 7 Documents
Search

 1 
Pelabelan Antiajaib Berdasarkan Jarak pada Operasi Perkalian Tensor Graf Christyan Tamaro Nadeak
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 10 Issue 2 December 2022
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v10i2.16298

Abstract

Let  be a graph of order n. Let  be a bijection. For any vertex , the neighbor sum  is called the weight of the vertex  and is denoted by where N(v) is the open neighborhood of If  for any two distinct vertices  and then f is called a distance antimagic labelling. If the graph G admits such a labelling, then G is said to be a distance antimagic graph. This study gives a distance antimagic labelling for tensor product of two complete graph and sufficient condition so that the tensor product of a regular graph and complete graph is a distance antimagic graph.
Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf Christyan Tamaro Nadeak
Indonesian Journal of Applied Mathematics Vol 3 No 1 (2023): Indonesian Journal of Applied Mathematics Vol. 3 No. 1 July Chapter
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat (LPPM), Institut Teknologi Sumatera, Lampung Selatan, Lampung, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/indojam.v3i1.1259

Abstract

Batchelor-Wilkins Algorithm is a simple and heuristic clustering algorithm used when the number of classes is unknown. In this paper we will use Batchelor-Wilkins algorithm in graph clustering, specifically a Banana Tree Graph B(n,k), a graph obtained by connecting one leaf of each of n copies of a complete bipartite graph K_{1,k-1} to a single root vertex.
Natural Resources Data Visualization Training Using Google Data Studio in Triharjo Village, Merbau Mataram District, South Lampung Regency Muthoharoh, Luluk; S, Mika Alvionita; Irawati, Febri Dwi; Setiawan, Tirta; Nadeak, Christyan Tamaro
Smart Society Vol 3, No 2 (2023): December 2023
Publisher : FOUNDAE (Foundation of Advanced Education)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58524/smartsociety.v3i2.287

Abstract

Visualization is becoming as the most frequent tool for examining and extracting information from datasets by novice and professional researchers alike. Many data processing applications help to present and report data. One of the digital tools that is quite widely used is Google Data Studio. This Community Service activity aims to provide data visualization training to Triharjo Village, one of the villages that still does not use digitalization to access village data online. Natural Resources Data Visualization Training Using Google Data Studio in Triharjo Village, Merbau Mataram District, South Lampung Regency has been successfully implemented and attended by 10 (ten) participants consisting of village officials. This activity is very necessary to facilitate the monitoring of agricultural products from Triharjo Village on the dashboard via the village website. The target in community service has also been achieved and serves to provide problem solving for problems that occur with partners, namely in the form of: 1. Can introduce the Tiharjo village community to the importance of digitizing performance dashboards. 2. Can teach how to use Google Data Studio tools which can be used to help the process of creating Dashboards. With this training, it is hoped that it can help manage natural resource data which will help village officials and village communities, teachers and students in providing information services related to data visualization.
Distance Magic Labeling of Corona Product of Graphs Nadeak, Christyan Tamaro
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 6, No 1 (2024)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v6i1.38317

Abstract

Let G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v)  is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a distance magic labeling for the graph G. If a graph G has a distance magic labeling, then G is called a distance magic graph. This paper presents a novel result that has not been extensively explored in previous research on the distance magic labeling for the corona product between several families of graphs, such as a complete, cycle, path, and star graph.Keywords: Distance magic labeling; Corona product; Complete graph; Cycle graph; Path graph; Star graph. AbstrakMisalkan G = (V, E) adalah graf berorde n, dan f: V(G) → {1,2,...,n}  merupakan suatu bijeksi. Untuk sebarang titik vϵ V, jumlahan dari f(u) merupakan bobot dari titik v dan dinotasikan dengan w(v), dengan N(v) merupakan himpunan tetangga dari titik v. Jika pelabelan f memenuhi terdapat suatu konstanta k sehingga w(v)=k, untuk setiap titik v yang terdapat pada graf G, maka f disebut sebagai pelabelan ajaib jarak bagi graf G. Jika suatu graf G memiliki pelabelan ajaib jarak, maka G disebut sebagai graf ajaib jarak. Paper ini memberikan hasil yang belum pernah dibahas sebelumnya, yaitu pelabelan ajaib jarak untuk operasi korona antara beberapa keluarga graf, seperti graf lengkap, graf siklus, graf lintasan, dan graf bintang.Kata Kunci: Pelabelan ajaib jarak; Operasi korona; Graf lengkap; Graf siklus; Graf lintasan; Graf bintang. 2020MSC: 
PELABELAN TOTAL (A,D)-SISI ANTIAJAIB SUPER PADA GRAF G + K_1 Nadeak, Christyan Tamaro
MATHunesa: Jurnal Ilmiah Matematika Vol. 13 No. 2 (2025)
Publisher : Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Let be a graph of order and size . A bijection is called -edge antimagic total labeling if the set of edge weight forms an arithmetic sequence with initial term a and difference d, or equals to the set . An -edge antimagic total labeling is called super -edge antimagic total labeling if the labelling of the vertex set is This study discuss a super -edge antimagic total labeling for graph .
Distance Magic Labeling of Corona Product of Graphs Nadeak, Christyan Tamaro
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 6 No. 1 (2024)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v6i1.38317

Abstract

Let G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v)  is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a distance magic labeling for the graph G. If a graph G has a distance magic labeling, then G is called a distance magic graph. This paper presents a novel result that has not been extensively explored in previous research on the distance magic labeling for the corona product between several families of graphs, such as a complete, cycle, path, and star graph.Keywords: distance magic labeling; corona product; complete graph; cycle graph; path graph; star graph. AbstrakMisalkan G = (V, E) adalah graf berorde n, dan f: V(G) → {1,2,...,n}  merupakan suatu bijeksi. Untuk sebarang titik vϵ V, jumlahan dari f(u) merupakan bobot dari titik v dan dinotasikan dengan w(v), dengan N(v) merupakan himpunan tetangga dari titik v. Jika pelabelan f memenuhi terdapat suatu konstanta k sehingga w(v)=k, untuk setiap titik v yang terdapat pada graf G, maka f disebut sebagai pelabelan ajaib jarak bagi graf G. Jika suatu graf G memiliki pelabelan ajaib jarak, maka G disebut sebagai graf ajaib jarak. Paper ini memberikan hasil yang belum pernah dibahas sebelumnya, yaitu pelabelan ajaib jarak untuk operasi korona antara beberapa keluarga graf, seperti graf lengkap, graf siklus, graf lintasan, dan graf bintang.Kata Kunci: pelabelan ajaib jarak; operasi korona; graf lengkap; graf siklus; graf lintasan; graf bintang. 2020MSC: 
Prediksi Harga Penutupan Saham BMRI Menggunakan Metode Bidirectional Long Short-Term Memory Nadeak, Christyan Tamaro
Jurnal Ilmiah Matematika Vol. 12 No. 2 (2025)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/jim.v12i2.31310

Abstract

In recent years, Indonesia's capital market has grown significantly, with the number of investors rising from 3.8 million in 2020 to 12.3 million in January 2024. This study explores the application of the Bi-LSTM model to predict BMRI stock prices by systematically optimizing 75 models to obtain optimal hyperparameters. Unlike prior trial-and-error approaches, this research employs structured hyperparameter exploration using data splits of 70:30, 80:20, and 90:10 to evaluate model accuracy and stability. Results show excellent performance with a MAPE of 2.182% on BMRI’s historical closing prices from January 1, 2021, to July 31, 2024, using a 2-layer Bi-LSTM architecture, batch size 16, and 150 epochs. The findings confirm that an appropriate model can produce highly accurate predictions. This study provides insight into Bi-LSTM modeling in the banking sector, offering valuable references and strategic considerations for investors and stakeholders based on predictive results.
Co-Authors Irawati, Febri Dwi Mika Alvionita Sitinjak Muthoharoh, Luluk Tirta Setiawan, Tirta