Showing math.COShow all
3 papers · 1 filter
math.CO2024
Local Distance Antimagic Vertex Coloring of Graphs
Divya T, Devi Yamini S
A bijective function is said to be a local distance antimagic labeling of a graph , if for any two adjacent v…
math.CO2024
Graceful coloring is computationally hard
Cyriac Antony, Laavanya D., Devi Yamini S
Given a (proper) vertex coloring of a graph , say , the difference edge labelling induced by is a function defin…
math.CO2024
An Analysis of Graceful Coloring in a Specific r-Regular Graphs
Laavanya D., Devi Yamini S.
A graceful -coloring of a graph is a proper vertex coloring with colors which induces a proper edge coloring with at most colors, where the color for an edge …