Font Size: 

ABSTRACT

There are many graph labeling that have been developed, one of which is a graceful labeling. A graceful labeling of a graph  with edges is an injection  such that the resulting edge labels obtained by  on every edge  are pairwise distinct. An aster flower graph  is a graph which generated from a cycle graph  by connecting path graphs  at two adjacent vertices. A corona product of aster flower graph  is a graph which generated from an aster graph  by adding  leaf vertices on each vertex. In this paper, we present graceful labeling of corona product of aster flower graph that is . Illustration of graph

 

Figure 1. Corona product of aster graph  .

 

Theorem 1. Corona product of Aster Graph, for every  has a graceful labeling.

Graceful labeling; Corona product graph; Aster flower graph.