GRACEFUL COLORING OF LADDER GRAPHS

GRACEFUL COLORING OF LADDER GRAPHS

D. Laavanya, S. D. Yamini

[PDF]

Abstract

A graceful k-coloring of a non-empty graph G = (V;E) is a proper vertex coloring f : V (G) ! f1; 2; :::; kg, k   2, which induces a proper edge coloring f  : E(G) ! f1; 2; :::; k - 1g de ned by f (uv) = jf(u) - f(v)j, where u; v 2 V (G). The minimum k for which G has a graceful k-coloring is called graceful chromatic number,  g(G). The graceful chromatic number for a few variants of ladder graphs are investigated in this article.

Keywords

Graceful chromatic number, ladder graphs.