On rainbow vertex antimagic coloring and its application to the encryption keystream construction [PDF]
Let G = (V,E) be a graph that is a simple, connected and un-directed graph. We now introduce a new notion of rainbow vertex antimagic coloring. This is a proper development of antimagic labeling with rainbow vertex coloring.
Nagaraja, Vaishnavi +6 more
core +1 more source
Antimagic labeling of regular graphs
, 2016 A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
core +1 more source
Penentuan Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf berlian. [PDF]
, 2017 Misalkan G = (V,E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1,2,...,k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Suci, Riezsa Dessyluviani
core +1 more source
Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique [PDF]
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Robiatul Adawiyah +11 more
core +1 more source
The Rainbow (Vertex) Connection Number of Pencil Graphs [PDF]
, 2015 An edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in ...
Simamora, Dian N.S., Salman, A.N.M.
core +1 more source
Total Rainbow Connection Number of Some Graph Operations
, 2022 In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H),
Yan Zhao, Yingbin Ma, Hengzhe Li
core +1 more source
On the Rainbow Connection Number for Snowflake Graph [PDF]
, 2023 Let G be an arbitrary non-trivial connected graph. An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors, such path is called a rainbow path.
Yulianti, Lyra +3 more
core +1 more source
Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]
, 2017 INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core
On The Rainbow Antimagic Connection Number of Some Wheel Related Graphs
, 2019 All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and edge set . A bijection function * | ( )|+ is called an edge antimagic vertex labelling if for every ( ), the ...
KUSUMAWARDANI, Intan +3 more
core
On rainbow vertex antimagic coloring and its application on STGNN time series forecasting on subsidized diesel consumption [PDF]
Let G = (V, E) be a simple, connected and un-directed graph. We introduce a new notion of rainbow vertex antimagic coloring. This is a natural expansion of rainbow vertex coloring combined with antimagic labeling. For f: E(G) → 1, 2,…, |E(G)|, the weight
Dafik +6 more
core +3 more sources