Christyan Tamaro Nadeak

Mr. Christyan Tamaro Nadeak

Institut Teknologi Bandung
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 November 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
RSRinovia Simanjuntak
Rinovia Simanjuntak
CNChristyan Tamaro Nadeak
Christyan Tamaro Nadeak
Fuad YasinFuad Yasin
Fuad Yasin
KWKristiana Wijaya
Kristiana Wijaya
Nurdin HindingNurdin Hinding
Nurdin Hinding
KSKiki Sugeng
Kiki Sugeng
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼xf(y) distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than K2 admits an antimagic labeling. For a set of distances D, a D-antimagic labeling of a graph G is a bijection f:V(G)→{1,…,|V(G)|} such that the weightω(x)=∑y∈ND(x)f(y) is distinct for each vertex x, where ND(x)={y∈V(G)|d(x,y)∈D} is the D-neigbourhood set of a vertex x. If ND(x)=r, for every vertex x in G, a graph G is said to be (D,r)-regular. In this paper, we conjecture that a graph admits a D-antimagic labeling if and only if it does not contain two vertices having the same D-neighborhood set. We also provide evidence that the conjecture is true. We present computational results that, for D={1}, all graphs of order up to 8 concur with the conjecture. We prove that the set of (D,r)-regular D-antimagic graphs is closed under union. We provide examples of disjoint union of symmetric (D,r)-regular that are D-antimagic and examples of disjoint union of non-symmetric non-(D,r)-regular graphs that are D-antimagic. Furthermore, lastly, we show that it is possible to obtain a D-antimagic graph from a previously known distance antimagic graph.

20 October 2022 in Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
Verified
Journal Article
Open access
PDF file
CNChristyan Tamaro Nadeak
Christyan Tamaro Nadeak
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.

15 October 2025 in Desimal: Jurnal Matematika
Verified
Journal Article
Open access
CNChristyan Tamaro Nadeak
Christyan Tamaro Nadeak
FFFajri Farid
Fajri Farid
LRLinda Rassiyanti
Linda Rassiyanti
ASArielva Simon Siahaan
Arielva Simon Siahaan
LPLutfia Aisyah Putri
Lutfia Aisyah Putri
This study proposes a modified Directed Acyclic Graph Support Vector Machine (DAG-SVM) using a Rest-vs-Rest (RvR) strategy to address the multiclass classification problem in the Hepatitis C dataset from Kaggle, which contains four diagnostic categories with a highly imbalanced class distribution, with class sample sizes of 540, 24, 21, and 30, respectively. The aim of this study is to examine how hierarchical decision structures interact with extreme class imbalance in SVM-based multiclass classification. The method is implemented through three fixed hierarchical decision schemes {0,1} vs. {2,3}, {0,2} vs. {1,3}, and {0,3} vs. {1,2} which restructure the decision flow of conventional DAG-SVM. Experimental evaluation shows that although the proposed schemes achieve relatively high overall accuracy (0.91–0.93), the precision, recall, and F1-scores for minority classes remain extremely low. These findings offer a new empirical insight into how class imbalance propagates through the DAG hierarchy, leading to early elimination of minority classes, and highlight the need for imbalance-handling techniques such as resampling, cost-sensitive learning, or synthetic data generation. The contribution of this work lies in demonstrating the limitations of DAG-RvR under severe imbalance and providing a structured evaluation that can guide future improvements for more reliable multiclass recognition.

20 April 2024 in InPrime: Indonesian Journal of Pure and Applied Mathematics
Verified
Journal Article
Open access
PDF file
CNChristyan Tamaro Nadeak
Christyan Tamaro Nadeak
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:

5 January 2026 in Journal of the Indonesian Mathematical Society
Verified
Journal Article
Open access
PDF file
CNChristyan Tamaro Nadeak
Christyan Tamaro Nadeak
Let $G=(V,E)$ be a graph of order $n$. A bijection $f:V(G)\rightarrow \{1,2,\cdots,n\}$ is called inclusive distance antimagic labeling if $w(u)\ne w(v)$ for any two distinct vertices $u,v\in V(G)$, where $w(v) = \displaystyle \sum_{x\in N[v]} f(x)$. We start our discussion with the connection between distance magic labeling and inclusive distance antimagic labeling. Then, we investigate the existence of an inclusive distance antimagic labeling for circulant graphs, disjoint union graphs, and join graphs.