• SQUARE DIFFERENCE LABELING FOR CERTAIN GRAPHS
Abstract
Let G(V,E) be a graph with p vertices and q edges. A graph G(p,q) is said to be a square difference graph if there exist a bijection f: V(G) ® {0,1,2 …., p-1 } such that the induced function f*: E(G) ® N, N is a natural number, given by f*(uv) =| [f(u)]2 –[f(v)]2 | for every edges uv G and are all distinct. In this paper we prove fan Fn(n≥2),Graph gn(n ≠ 6k-2, k ≥ 1), Middle graphs of Path Pn (n≥2), and Cycle Cn (n≥2), Total graphs of Path Pn (n≥2), and Cycle C2n+1 (n ≥2), Graphs of the form (P2m , C2n+1) (m≥1 ,n ≥1), and (Pm , Sn) ( m ≥1, n≥1) and the graph Pn2 (n ≥2) are the square difference graphs.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |