Graceful Labelling of Corona Product of Aster Flower Graph

DOI

10.2991/miseic-18.2018.17How to use a DOI?

Keywords

Graceful labelling, Corona product graph, Aster flower graph

Abstract

There are many graph labelling that have been developed, one of which is a graceful labelling. A graceful labelling of a graph G=(V,E) with E edges is an injectivef:V(G)→{0,1,…,|E|} that the resulting edge labels obtained by |f(u)-f(v)| on each edgesuv are pairwise distinct. An aster flower graph (A_((m,n) )) is a graph which generated from a cycle graph C_m,m≥3 by connecting path graphs P_(n+1),n≥1 at two adjacent vertices. A corona product of aster flower graph (A_((m,n) )⊙(K_r ) ̅) is a graph which generated from an aster graph (A_((m,n) ) ),m≥3,n≥1 by adding r leaf vertices on each vertex. In this paper, we present graceful labelling of corona product of aster flower graph that is A_((3,1) )⊙(K_r ) ̅.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Elvi Khairunnisa
AU  - Kiki Ariyanti Sugeng
PY  - 2018/07
DA  - 2018/07
TI  - Graceful Labelling of Corona Product of Aster Flower Graph
BT  - Proceedings of the Mathematics, Informatics, Science, and Education International Conference (MISEIC 2018)
PB  - Atlantis Press
SP  - 68
EP  - 71
SN  - 1951-6851
UR  - https://doi.org/10.2991/miseic-18.2018.17
DO  - 10.2991/miseic-18.2018.17
ID  - Khairunnisa2018/07
ER  -