S. Yamini

most citedAn Algorithmic Approach to Antimagic Labeling of Edge Corona Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022★ 1 cited

An Algorithmic Approach to Antimagic Labeling of Edge Corona Graphs

D. Nivedha, S. Devi Yamini

An antimagic labeling of a graph $G$ is a $1 - 1$ correspondence between the edge set $E (G)$ and ${1, 2, ..., ∣ E (G) ∣}$ in which the sum of the labels of edges incident to t…

math.CO2022

Graceful Coloring of Ladder Graphs

D Laavanya, S Devi Yamini

A graceful k-coloring of a non-empty graph $G = (V, E)$ is a proper vertex coloring $f : V (G) \to {1, 2, ..., k}$ , $k \geq 2$ , which induces a proper edge coloring $f^{*…