D. Laavanya

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.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^{*…