×

On harmonious labeling of Corona graphs. (English) Zbl 1406.05087

Summary: A graph \(G\) with \(q\) edges is said to be harmonious, if there is an injection \(f\) from the vertices of \(G\) to the group of integers modulo \(q\) such that when each edge \(xy\) is assigned the label \(f(x)+f(y) \pmod q\), the resulting edge labels are distinct. In this paper, we study the existence of harmonious labeling for the corona graphs of a cycle and a graph \(G\) and for the corona graph of \(K_2\) and a tree.

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDF BibTeX XML Cite
Full Text: DOI