Devi Yamini S

collaborators

3 papers

math.CO2024

Graceful coloring is computationally hard

Cyriac Antony, Laavanya D., Devi Yamini S

Given a (proper) vertex coloring $f$ of a graph $G$ , say $f : V (G) \to N$ , the difference edge labelling induced by $f$ is a function $h : E (G) \to N$ defin…

math.CO2024

An Analysis of Graceful Coloring in a Specific r-Regular Graphs

Laavanya D., Devi Yamini S.

A graceful $l$ -coloring of a graph $G$ is a proper vertex coloring with $l$ colors which induces a proper edge coloring with at most $l - 1$ colors, where the color for an edge $ab$ …

math.CO2023

Antimagic Labeling of Generalized Edge Corona Graphs

Nivedha D, Devi Yamini S

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