Rinovia Simanjuntak

Orcid: 0000-0002-3224-2376

According to our database1, Rinovia Simanjuntak authored at least 33 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Distance antimagic labelings of product graphs.
Electron. J. Graph Theory Appl., 2023

On (F, H)-simultaneously-magic labelings of graphs.
Electron. J. Graph Theory Appl., 2023

2022
Distance Antimagic Product Graphs.
Symmetry, 2022

Multipartite Ramsey Numbers of Union of Stars.
Electron. J. Graph Theory Appl., 2022

2021
Another Antimagic Conjecture.
Symmetry, 2021

D-Magic Oriented Graphs.
Symmetry, 2021

On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs.
Symmetry, 2021

On distance labelings of 2-regular graphs.
Electron. J. Graph Theory Appl., 2021

Group distance magic and antimagic hypercubes.
Discret. Math., 2021

2020
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths.
Electron. J. Graph Theory Appl., 2020

Total vertex irregularity strength for trees with many vertices of degree two.
Electron. J. Graph Theory Appl., 2020

D-magic strongly regular graphs.
AKCE Int. J. Graphs Comb., 2020

2019
On the super edge-magic deficiency of join product and chain graphs.
Electron. J. Graph Theory Appl., 2019

2018
Total vertex irregularity strength of trees with maximum degree five.
Electron. J. Graph Theory Appl., 2018

Computing the edge irregularity strengths of chain graphs and the join of two graphs.
Electron. J. Graph Theory Appl., 2018

2017
Super edge-magic labeling of graphs: deficiency and maximality.
Electron. J. Graph Theory Appl., 2017

2015
A Heuristic for Distance Magic Labeling.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Locating-chromatic Number for Graphs with Dominant Vertices.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Partition Dimension of a Subdivision of a Complete Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Local metric dimension of subgraph-amalgamation of graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Metric Dimension for Amalgamations of Graphs.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
The metric dimension of the lexicographic product of graphs.
Discret. Math., 2013

Super (a, d)-H-antimagic total labelings for shackles of a connected graph H.
Australas. J Comb., 2013

2011
Large bipartite Cayley graphs of given degree and diameter.
Discret. Math., 2011

On graph of order-n with the metric dimension n-3.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2008
Graphs of order two less than the Moore bound.
Discret. Math., 2008

On the super edge-magic deficiencies of graphs.
Australas. J Comb., 2008

2007
On Super Edge-Magic Strength and Deficiency of Graphs.
Proceedings of the Computational Geometry and Graph Theory, 2007

2003
Vertex-antimagic total labelings of graphs.
Discuss. Math. Graph Theory, 2003

Distance magic labelings of graphs.
Australas. J Comb., 2003

Maximum Order of Planar Digraphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003


  Loading...