2 citations · 3 across the 5 of their papers we have counts for
7 papers
D-Antimagic Labelings of Oriented Star Forests
Ahmad Muchlas Abrar, Rinovia Simanjuntak
For a distance set , an oriented graph is -antimagic if there exists a bijective vertex labeling such that the sum of all labels of -out-neighbors is…
D-Antimagic Labelings of Oriented 2-Regular Graphs
Ahmad Muchlas Abrar, Rinovia Simanjuntak
Given an oriented graph and a distance set of , is -antimagic if there exists a bijective vertex labeling such…
D-Antimagic Labelings on Oriented Linear Forests
Ahmad Muchlas Abrar, Rinovia Simanjuntak
Let be an oriented graph with the vertex set and the arc set . Suppose that …
Multiset Dimensions of Trees
Yusuf Hafidh, Rizki Kurniawan, Suhadi Saputro +3
Let be a connected graph and be a set of vertices of . The representation multiset of a vertex with respect to , , is defined as a multiset of distance…
-Magic and Antimagic Labelings of Hypercubes
Palton Anuwiksa, Akihiro Munemasa, Rinovia Simanjuntak
For a set of distances , a graph of order is said to be magic if there exists a bijection and a constant such that for any ve…
-Magic Strongly Regular Graphs
Rinovia Simanjuntak, Palton Anuwiksa
For a set of distances , a graph on vertices is said to be -magic if there exists a bijection and a constant such that for an…