1 research outputs found
On SD-Harmonious Labeling
Get PDFA graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this paper, we investigate SD-harmonious labeling of path related graphs, tree related graphs, star related graphs and disjoint union of graphs
