Department of Mathematics University of Jember, Jember, Jember, 68121, Indoensia
Ridho Alfarisi, Arika Indah Kristiana, Sharifah Kartini Said Husain
In this paper: In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the pat...
Ridho Alfarisi, Arika Indah Kristiana, Dafik, Qurotul A’yun, M. Venkatachalam
In this paper: A rainbow vertex anti-magic coloring represents a relatively new area of exploration in graph theory. This concept extends the idea of rainbow vertex coloring by incorporating elements of anti-magic l...
Arika Indah Kristiana, Ulziah Maghfirah, Ridho Alfarisi, Eko Waluyo, N. Mohanapriya, Dafik, R. M. Prihandini
In this paper: For any graph G = (V, E), with |V(G)| = p and |E(G)|= q. A bijection f : E(G) → {1, 2, 3,...,|E(G)|} is called an local (a,d)-edge antimagic coloring of G if the element of the edge-weight set w(uv) =...
Install TARU PUBLICATIONSFaster access from your home screen