CENTERED HEXAGONAL GRACEFUL LABELING OF N-STAR GRAPH

A. Ramalakshmi, M. P. Syed Ali Nisaya

Abstract


Let  be a graph. Let and denote the vertex set and edge set of  respectively. A centered hexagonal graceful labeling of a graph  is an one to one function that induces a bijection of the edges  of   defined by . The graph which admits such a labeling is called a centered hexagonal graceful graph. In this paper, we prove that -star graph is a centered hexagonal graceful graph.


Keywords


Centered hexagonal numbers, centered hexagonal graceful labeling, centered hexagonal graceful graph.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.