Abstract
CORONA PRODUCT OF COMPLETE GRAPHS
James Githinji Muya* and G. Shobhalatha
ABSTRACT
Graph labeling has a wide range of applications such as coding theory, X-ray crystallography, network design, circuit design. It can be done by assigning numbers to edges, vertices or both. An anti-magic labeling of a graph is a one-to-one correspondence between the edge set and the set such that the vertex sums are pairwise distinct. The vertex sum is the sum of labels assigned to edges incident to a vertex. Corona product of the graphs and is the graph which is obtained by taking one copy of and copies of and making the vertex of adjacent to every vertex of the copy of In this study, we prove that the Corona product generates anti-magic graphs. We also develop a programme using MATLAB to demonstrate this anti-magic property.
[Full Text Article] [Download Certificate]