Article Per Year (5 Year)
p-Index From 2021 - 2026
2.248
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) Journal of Mathematical and Fundamental Sciences Indonesian Journal of Combinatorics Journal La Multiapp Jurnal Locus Penelitian dan Pengabdian
Simanjuntak, Rinovia
Combinatorial Mathematics Research Group, Faculty Of Mathematics And Natural Sciences, Institut Teknologi Bandung
Aerospace Engineering Astronomy Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Engineering Mathematics Physics

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

Found 21 Documents
Search

 1   2   3 
On (F, H)-simultaneously-magic labelings of graphs Yeva Fadhilah Ashari; A.N.M. Salman; Rinovia Simanjuntak; Andrea Semaničová-Feňovčíková; Martin Baca
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.5

Abstract

A simple graph G(V, E) admits an H-covering if every edge in G belongs to a subgraph of G isomorphic to H. In this case, G is called H-magic if there exists a bijective function f : V ∪ E → {1, 2, …, |V|+|E|}, such that for every subgraph H′ of G isomorphic to H, wtf(H′) =  Σv ∈ V(H′)f(v)+ Σe ∈ E(H′)f(e) is constant. Moreover, G is called H-supermagic if f : V(G)→{1, 2, …, |V|}. This paper generalizes the previous labeling by introducing the (F, H)-sim-(super) magic labeling. A graph admitting an F-covering and an H-covering is called (F, H)-sim-(super) magic if there exists a function f that is F-(super)magic and H-(super)magic at the same time. We consider such labelings for two product graphs: the join product and the Cartesian product. In particular, we establish a sufficient condition for the join product G + H to be (K2 + H, 2K2 + H)-sim-supermagic and show that the Cartesian product G × K2 is (C4, H)-sim-supermagic, for H isomorphic to a ladder or an even cycle. Moreover, we also present a connection between an α-labeling of a tree T and a (C4, C6)-sim-supermagic labeling of the Cartesian product T × K2.
A note on vertex irregular total labeling of trees Faisal Susanto; Rinovia Simanjuntak; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.1

Abstract

The total vertex irregularity strength of a graph G=(V,E) is the minimum integer k so that there is a mapping from V ∪ E to the set {1,2,...,k} so that the vertex-weights (i.e., the sum of labels of a vertex together with the edges incident to it) are all distinct. In this note, we present a new sufficient condition for a tree to have total vertex irregularity strength ⌈(n1+1)/2⌉, where n1 is the number of vertices of degree one in the tree.
Magic labeling on graphs with ascending subgraph decomposition Pancahayani, Sigit; Simanjuntak, Rinovia; Uttunggadewa, Saladin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (2024): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2024.12.2.4

Abstract

Let t and q be positive integers that satisfy C(t + 1,2) ≤ q < C(t + 2,2) and let G be a simple and finite graph of size q. G is said to have ascending subgraph decomposition (ASD) if G can be decomposed into t subgraphs H1,H2,…,Ht without isolated vertices such that Hi is isomorphic to a proper subgraph of Hi+1 for 1 ≤ i ≤ t - 1, where {E(H1),…,E(Ht)} is a partition of E(G). A graph that admits an ascending subgraph decomposition is called an ASD graph.In this paper, we introduce a new type of magic labeling based on the notion of ASD. Let G be an ASD graph and f : V (G) ∪E(G) →{1,2,…,|V (G)| + |E(G)|} be a bijection. The weight of a subgraph Hi (1 ≤ i ≤ n) is w(Hi) = ∑ v∈V (Hi)f(v) + ∑ e∈E(Hi)f(e). If the weight of each ascending subgraph is constant, say w(Hi) = k, ∀ 1 ≤ i ≤ t, then f is called an ASD-magic labeling of G and G is called an ASD-magic graph. We present general properties of ASD-magic graphs and characterize certain classes of them.
Further results on the total vertex irregularity strength of trees Susanto, Faisal; Simanjuntak, Rinovia; Baskoro, Edy Tri
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.9

Abstract

We investigate the total vertex irregularity strength of trees with specific characteristics. Initially, we categorize trees into three distinct groups: types A, B, and C. Subsequently, we calculate tvs(T) for all type A trees T where the maximum degree is at least three. Additionally, we provide the value of tvs(T) whenever T is a tree of types B or C with maximum degree at least three and large number of exterior vertices. Finally, we propose a conjecture related to tvs(T) where T is a non-path tree of types B or C with few exterior vertices. 
On (super) edge-magic deficiency of some classes of graphs Ngurah, Anak Agung Gede; Simanjuntak, Rinovia; Baskoro, Edy Tri
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.4

Abstract

A graph G of order p and size q is called edge-magic total if there exists a bijection ϕ from V(G)∪E(G) to the set {1, 2, …, p + q} such that ϕ(s)+ϕ(st)+ϕ(t) is a constant for every edge st in E(G). An edge-magic total graph with ϕ(V(G)) = {1, 2, …, p} is called super edge-magic total. Furthermore, the edge-magic deficiency of a graph G is the smallest integer n ≥ 0 such that G ∪ nK1 is edge-magic total. The super edge-magic deficiency of a graph G is either the smallest integer n ≥ 0 such that G ∪ nK1 is super edge-magic total or +∞ if there exists no such integer n. In this paper, we study the (super) edge-magic deficiency of join product graphs and 2-regular graphs.
Learning to Optimize Meter Reading Routes in Billing Management Problems in the Balata Regional Unit Muchtar, Gatot Mochamad; Simanjuntak, Rinovia Mery Garnierita
Journal La Multiapp Vol. 6 No. 2 (2025): Journal La Multiapp
Publisher : Newinera Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37899/journallamultiapp.v6i2.2043

Abstract

Meter reading route optimization is a significant challenge in the billing management of the State Electricity Company (PLN). This study evaluates the potential of the Traveling Salesman Problem (TSP) in overcoming this problem. By applying TSP to the Balata Region case study, this study aims to find a more efficient and effective route solution. The results of the study are expected to reduce operational costs, increase officer productivity, and increase customer satisfaction. It is hoped that TSP can be an attractive alternative for electricity companies in optimizing the meter reading process.
D-antimagic labelings arising from completely separating systems Wulandari, Risma Yulina; Simanjuntak, Rinovia; Saputro, Suhadi Wido
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.2.2

Abstract

Let D be a non-empty subset of the distance set {0,1,…, diam(G)}. A graph G is D-antimagic if there exists a bijection f:V(G)→{1,2,…,|V(G)|} such that for every pair of distinct vertices x and y, wD(x) ≠ wD(y), where wD(x) = Σz∈ND(x)f(z) is the D-weight of x and ND(x) = {z|d(x,z)∈D} is the D-neighbourhood of x. It was conjectured that a graph G is D-antimagic if and only if each vertex in G has a distinct D-neighborhood. A completely separating system (CSS) in the finite set {1,2,…,n} is a collection ? of subsets of {1,2,…,n} in which for each pair a≠b∈{1,2,…,n}, there exist A,B∈? such that a∈A−B and b∈B−A.In this paper, we provide evidence to support the conjecture mentioned earlier by using Roberts' completely separating systems to define D-antimagic labelings for certain graphs. In particular, we show that if G and H are D-antimagic graphs with labelings constructed from Roberts' CSS, then the vertex-deleted subgraph, G−{v} and the vertex amalgamation of G and H are also D-antimagic. Additionally, we partially answer an open problem of Simanjuntak et al. (2021) by constructing {1}-antimagic labelings for some disjoint unions of paths.
On the relations among edge magic total, edge antimagic total, and ASD-antimagic graphs Pancahayani, Sigit; Simanjuntak, Rinovia; Baca, Martin; Semanicova-Fenovcıkova, Andrea; Uttunggadewa, Saladin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.2.11

Abstract

Let G be a simple and finite graph of order p and size q. The graph G is said to be edge magic total (EMT) if there is a bijection λ:V(G)∪E(G)→{1,2,…,p+q} such that all edge sums λ(x)+λ(xy)+λ(y), xy∈E(G), are the same. If all edge sums are pairwise distinct, then G is called edge antimagic total (EAT). Let t be a positive integer that satisfies C(t+1,2)≤q<C(t+2,2). The graph G is said to have an ascending subgraph decomposition (ASD) if G can be decomposed into t subgraphs H1,H2,…,Ht without isolated vertices such that Hi is isomorphic to a proper subgraph of Hi+1 for 1≤i≤t−1. A graph that admits an ascending subgraph decomposition is called an ASD graph. An ASD graph G is said to be ASD-antimagic if there exists a bijection f:V(G)∪E(G)→{1,2,…,p+q} such that all subgraph weights w(Hi)=∑v∈V(Hi)f(v)+∑e∈E(Hi)f(e), 1≤i≤t, are distinct. In this paper, we provide constructions of ASD-antimagic graphs arising from EMT or EAT graphs.
A Spatial-Based Planning Analysis for Transmission Line Development Using the Multi-Criteria Decision Analysis (MCDA) Approach Anam, Juzd Thoha Chairul; Garnierita Simanjuntak, Rinovia Mery; Muzaki, Anggi Afif
Jurnal Locus Penelitian dan Pengabdian Vol. 4 No. 7 (2025): JURNAL LOCUS: Penelitian dan Pengabdian
Publisher : Riviera Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58344/locus.v4i7.4281

Abstract

Through the Electricity Supply Business Plan (RUPTL) 2021–2023, PT PLN (Persero) outlined plans for the development of transmission systems across Indonesia, projecting an expansion of 76,662 MVA in substation capacity and 47,723 kilometres of transmission lines by 2030. Transmission infrastructure development is further detailed for each major island system in the country. In particular, the transmission network in Sulawesi remains divided into two systems: Southern Sulawesi (SULBAGSEL) and Northern Sulawesi (SULBAGUT). The RUPTL document also highlights several strategic projects in the Sulawesi transmission system, including the 150 kV Tambu–Bangkir Transmission Line. Following an instruction from the Directorate General of Electricity to accelerate the Commercial Operation Date (COD) for the Tambu–Bangkir segment to 2024, the project timeline has been adjusted accordingly and designated as a priority assignment. Current transmission line construction planning still relies on manual methods, which have several weaknesses, including route inefficiency, potential cost overruns, challenges in accessing planning locations, and low planning accuracy that often does not reflect actual field conditions. This approach also inadequately considers disaster factors and the aspects of environmental, social, and corporate governance. This research aims to develop a more effective and efficient method for transmission line planning that reduces cost overruns while improving accessibility and planning accuracy. Additionally, this study will explore ways to incorporate land use, road access, disaster factors, and environmental, social, and corporate governance considerations. Spatial modeling using the Multi-Criteria Decision Analysis (MCDA) method can offer a more comprehensive approach, making transmission line planning more optimal and sustainable.
Outer multiset dimension of joined graphs Hassan Pervaiz; Rinovia Simanjuntak; Suhadi Wido Saputro
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2025.9.2.1

Abstract

The outer multiset dimension of graph G, dimms(G), is the cardinality of the smallest subset S of vertices that uniquely recognizes each vertex outside S by using the multiset of distances between the vertex and the vertices in S. In 2023, Klavzar, Kuziak, and Yero proved that the only graphs with the largest outer multiset dimension, that is, one less than their order, are regular graphs of diameter at most 2. This paper considers the outer multiset dimensions of non-regular graphs of diameter 2 obtained from the join product, in particular, stars, wheels, generalized wheels, windmills, fans, and generalized fans. 
Co-Authors A.N.M. Salman A.N.M. Salman Ali Ahmad Anak Agung Gede Ngurah Anak Agung Gede Ngurah Anam, Juzd Thoha Chairul Andrea Semaničová-Feňovčíková Ashok Gupta Baca, Martin Baskoro, Edy Tri Bety Hayat Susanti Edy Tri Baskoro Faisal Susanto Fawwaz Chirag Sofyan Hassan Pervaiz I Wayan Palton Anuwiksa Kiki A. Sugeng Martin Baca Muchtar, Gatot Mochamad Muzaki, Anggi Afif Nurdin Hinding Pancahayani, Sigit Pancahayani, Sigit Risma Yulina Wulandari Saladin Uttunggadewa Saputro, Suhadi Wido Semanicova-Fenovcıkova, Andrea Suhadi Wido Saputro Susanto, Faisal Susilawati, S. Syafrizal Sy Wulandari, Risma Yulina Yeva Fadhilah Ashari