• SOME RESULTS ON ELEGANT GRAPHS
Abstract
In 1981, Chang, Hsu and Rogers [1] defined an elegant labeling f of a graph G with q edges as an injective function from the vertices of G to the set {0, 1, 2, . . . , q} such that when each edge xy is assigned the label (f(x) + f(y)) (mod (q+1)), the resulting edge labels are distinct and non – zero. In this paper, certain families of graphs are shown to be elegant.
Keywords
Graph labeling, cycles, paths, total graph, jelly fish, K2 + mK1, (P2 mK1) + N2, C3, K1,m, (K4 – {e})t, etc., and elegant labeling.
Full Text:
PDFThis 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 |