Results 71 to 80 of about 1,609,249 (128)
All Graphs Have Antimagic Total Labelings
Abstract Let G = ( V , E ) be a finite, simple, indirected and either connected or disconnected. A antimagic total labeling of a graph G = ( V , E ) with p vertices and q edges is a bijection l : V ∪ E → { 1 , 2 , … , p + q } such that all vertex weights are pairwise distinct, where a vertex weight is the
Miller, Mirka +2 more
openaire +1 more source
This article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
Antimagic Labeling of Regular Graphs [PDF]
Feihuang Chang +3 more
openaire +1 more source
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
The combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source
On the antimagicness of generalized edge corona graphs. [PDF]
D N, S DY.
europepmc +1 more source
Data Encryption Using Face Antimagic Labeling and Hill Cipher
B. Vasuki, L. Shobana, B. Roopa
semanticscholar +1 more source
QSPR graph model to explore physicochemical properties of potential antiviral drugs of dengue disease through novel coloring-based topological indices. [PDF]
Yogalakshmi C, Balamurugan BJ.
europepmc +1 more source
Lucas Antimagic Labeling of some Star Related Graphs
P. Sumathi, N. Chandravadana
semanticscholar +1 more source
Local antimagic labelling for trees
Subhabrata Paul, Soumen Raul
openaire +2 more sources

