• MAGIC LABELING OF SEMIGRAPH
Abstract
A semigraph G=(V,X) with p vertices is called magic if the vertices of G can be distinctly labeled 1 through p in such a way that when taking the sum of the vertex labels on each edge, the sums will be same. A semigraph G = (V, X) is edge complete if any two edges in G are adjacent.
Keywords
(p, 2)-edge complete semigraph, magic labeling.
Full Text:
pdf
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |