Rinovia Simanjuntak

activity

20132025

most citedThe multiset dimension of graphs

14 citations · 31 across the 16 of their papers we have counts for

collaborators

17 papers

math.CO2025

Local (Outer) Multiset Dimensions of Graphs

Rinovia Simanjuntak, M. Ali Hasan, Muhung Anggarawan

Let $G$ be a finite, connected, undirected, and simple graph and $W$ be a set of vertices in $G$ . A representation multiset of a vertex $u$ in $V (G)$ with respect to $W$ is defined…

math.CO2025

D-Antimagic Labelings of Oriented Star Forests

Ahmad Muchlas Abrar, Rinovia Simanjuntak

For a distance set $D$ , an oriented graph $G$ is $D$ -antimagic if there exists a bijective vertex labeling such that the sum of all labels of $D$ -out-neighbors is…

math.CO2025

D-Antimagic Labelings of Oriented 2-Regular Graphs

Ahmad Muchlas Abrar, Rinovia Simanjuntak

Given an oriented graph $G$ and $D$ a distance set of $G$ , $G$ is $D$ -antimagic if there exists a bijective vertex labeling such…

math.CO2025

D-Antimagic Labelings on Oriented Linear Forests

Ahmad Muchlas Abrar, Rinovia Simanjuntak

Let $G$ be an oriented graph with the vertex set $V (G)$ and the arc set $A (G)$ . Suppose that $D \subseteq {0, 1, \dots, \partial}$ …

math.CO2023

Multipartite Ramsey numbers of complete bipartite graphs arising from algebraic combinatorial structures

I Wayan Palton Anuwiksa, Rinovia Simanjuntak, Edy Tri Baskoro

In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramse…

math.CO2019

Multiset Dimensions of Trees

Yusuf Hafidh, Rizki Kurniawan, Suhadi Saputro +3

Let $G$ be a connected graph and $W$ be a set of vertices of $G$ . The representation multiset of a vertex $v$ with respect to $W$ , $r_{m} (v ∣ W)$ , is defined as a multiset of distance…

math.CO2019★ 2 cited

$D$ -Magic and Antimagic Labelings of Hypercubes

Palton Anuwiksa, Akihiro Munemasa, Rinovia Simanjuntak

For a set of distances $D$ , a graph $G$ of order $n$ is said to be $D -$ magic if there exists a bijection $f : V \to {1, 2, \dots, n}$ and a constant $k$ such that for any ve…

math.CO2019

$D$ -Magic Strongly Regular Graphs

Rinovia Simanjuntak, Palton Anuwiksa

For a set of distances $D$ , a graph $G$ on $n$ vertices is said to be $D$ -magic if there exists a bijection $f : V \to {1, 2, \dots, n}$ and a constant $k$ such that for an…

math.CO2017★ 1 cited

Distance magic labelings of product graphs

Rinovia Simanjuntak, I Wayan Palton Anuwiksa

A graph $G$ is said to be distance magic if there exists a bijection $f : V \to {1, 2, \dots, v}$ and a constant {\sf k} such that for any vertex $x$ , $\sum_{y\in N(x)} f(y…

math.CO2017★ 14 cited

The multiset dimension of graphs

Rinovia Simanjuntak, Presli Siagian, Tomas Vetrik

We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of…

math.CO2015★ 2 cited

The local metric dimension of subgraph-amalgamation of graphs

Gabriel A. Barragan-Ramirez, Rinovia Simanjuntak, Suhadi W. Saputro +1

A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$ .…

math.CO2014

Metric Dimension of Amalgamation of Regular Graphs

Rinovia Simanjuntak, Danang Tri Murdiansyah

A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$ . The metric dimension of $G$ is the minimum card…

math.CO2014★ 4 cited

Super edge-magic deficiency of join-product graphs

A. A. G. Ngurah, Rinovia Simanjuntak

A graph $G$ is called \textit{super edge-magic} if there exists a bijective function $f$ from $V (G) \cup E (G)$ to ${1, 2, \dots, ∣ V (G) \cup E (G) ∣}$ such that $f(V(G)) = \{1, 2,…

math.CO2014★ 2 cited

Directed Metric Dimension of Oriented Graphs with Cyclic Covering

Sigit Pancahayani, Rinovia Simanjuntak

Let $D$ be a strongly connected oriented graph with vertex-set $V$ and arc-set $A$ . The distance from a vertex $u$ to another vertex $v$ , $d (u, v)$ is the minimum length of oriented…

math.CO2013★ 3 cited

Magic labelings of distance at most 2

Rinovia Simanjuntak, Mona Elviyenti, Mohammad Navie Jauhari +2

For an arbitrary set of distances $D \subseteq {0, 1, \dots, d}$ , a graph $G$ is said to be $D$ -distance magic if there exists a bijection $f : V \to {1, 2, \dots, v}$ and…

math.CO2013★ 3 cited

On Distance Antimagic Graphs

Rinovia Simanjuntak, Kristiana Wijaya

For an arbitrary set of distances $D \subseteq {0, 1, \dots, d iam (G)}$ , a $D$ -weight of a vertex $x$ in a graph $G$ under a vertex labeling $f : V \to {1, 2, \dots, v}$ is…

math.CO2013

Metric Dimension of Amalgamation of Graphs

Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro

A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$ . The metric dimension of $G$ is the minimum card…

Local (Outer) Multiset Dimensions of Graphs

D-Antimagic Labelings of Oriented Star Forests

D-Antimagic Labelings of Oriented 2-Regular Graphs

D-Antimagic Labelings on Oriented Linear Forests

Multipartite Ramsey numbers of complete bipartite graphs arising from algebraic combinatorial structures

Multiset Dimensions of Trees

D-Magic and Antimagic Labelings of Hypercubes

D-Magic Strongly Regular Graphs

Distance magic labelings of product graphs

The multiset dimension of graphs

The local metric dimension of subgraph-amalgamation of graphs

Metric Dimension of Amalgamation of Regular Graphs

Super edge-magic deficiency of join-product graphs

Directed Metric Dimension of Oriented Graphs with Cyclic Covering

Magic labelings of distance at most 2

On Distance Antimagic Graphs

Metric Dimension of Amalgamation of Graphs

$D$ -Magic and Antimagic Labelings of Hypercubes

$D$ -Magic Strongly Regular Graphs