Search Results - "Simanjuntak, Rinovia"

Distance Antimagic Product Graphs by Simanjuntak, Rinovia, Tritama, Aholiab

“…A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for two distinct vertices x and y, ω(x)≠ω(y), where…”
Get full text

D-Magic Oriented Graphs by Marr, Alison, Simanjuntak, Rinovia

“…In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct…”
Get full text

D-magic strongly regular graphs by Simanjuntak, Rinovia, Anuwiksa, Palton

“…For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the…”
Get full text

Cyber insurance ratemaking: A graph mining approach by Antonio, Yeftanus, Indratno, Sapto Wahyu, Simanjuntak, Rinovia

“…Cyber insurance ratemaking (CIRM) is a procedure used to set rates (or prices) for cyber insurance products provided by insurance companies. Rate estimation is…”
Get full text

Counterexamples to the total vertex irregularity strength’s conjectures by Faisal Susanto, Rinovia Simanjuntak, Edy Tri Baskoro

Get full text

On the permutation cycle structures for almost Moore digraphs of degrees 4 and 5 by Josep M. Miret, Rinovia Simanjuntak, Sergi Simón

Get full text

Improving data security with the utilization of matrix columnar transposition techniques by Tulus, Sy, Syafrizal, Sugeng, Kiki A., Simanjuntak, Rinovia, Marpaung, J.L.

“…The Graph Neural Network (GNN) is an advanced use of graph theory that is used to address complex network problems. The application of Graph Neural Networks…”
Get full text

Distance antimagic labeling of circulant graphs by Sy, Syafrizal, Simanjuntak, Rinovia, Nadeak, Tamaro, Sugeng, Kiki Ariyanti, Tulus, Tulus

“…A distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two…”
Get full text

On distance labelings of 2-regular graphs by Ngurah, Anak Agung Gede, Simanjuntak, Rinovia

“…Let G  be a graph with |V(G)| vertices and ψ :  V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) =…”
Get full text

Another Antimagic Conjecture by Simanjuntak, Rinovia, Nadeak, Tamaro, Yasin, Fuad, Wijaya, Kristiana, Hinding, Nurdin, Sugeng, Kiki Ariyanti

“…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…”
Get full text

Two types irregular labelling on dodecahedral modified generalization graph by Hinding, Nurdin, Sugeng, Kiki A., Nurlindah, Wahyudi, Timothy J., Simanjuntak, Rinovia

“…Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct…”
Get full text

On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs by Ashari, Yeva Fadhilah, Salman, A.N.M., Simanjuntak, Rinovia

“…A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph H. G is said to be H-magic if there exists a bijection…”
Get full text

On the super edge-magic deficiency of join product and chain graphs by Ngurah, Anak Agung Gede, Simanjuntak, Rinovia

“…A graph G of order ∣V(G)∣ = p and size ∣E(G)∣ = q is called super edge-magic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3, ⋯, p + q} such that f(x) +…”
Get full text

Total vertex irregularity strength for trees with many vertices of degree two by Simanjuntak, Rinovia, Susilawati, Susilawati, Baskoro, Edy Tri

“…For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different…”
Get full text

Computing the edge irregularity strengths of chain graphs and the join of two graphs by Ahmad, Ali, Gupta, Ashok, Simanjuntak, Rinovia

“…In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in…”
Get full text

Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph by Bača, Martin, Salman, A N M, Simanjuntak, Rinovia, Susanti, Bety Hayat

“…An edge-colored graph G is rainbow k -connected, if for every two vertices of G , there are k internally disjoint rainbow paths, i.e., if no two edges of each…”
Get full text

Total vertex irregularity strength of trees with maximum degree five by Susilawati, S, Baskoro, Edy Tri, Simanjuntak, Rinovia

“…In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of…”
Get full text

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths by Susanti, Bety Hayat, Salman, A.N.M., Simanjuntak, Rinovia

“…An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow…”
Get full text

Super edge-magic labeling of graphs: deficiency and maximality by Nguraha, Anak Agung Gede, Simanjuntak, Rinovia

“…A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) +…”
Get full text

Distance antimagic labelings of product graphs by Wulandari, Risma Yulina, Simanjuntak, Rinovia

Get full text