Root Square Mean Labeling of Disjoint Union of Path and The Middle Graph Rismawati Ramdani, Astrid Yuni Fanisa, Deni Miharja
UIN Sunan Gunung Djati Bandung
Abstract
For any graph G with p vertices and q edges. A labeling f of G is said to be a root square mean labeling of G if f is a mapping of vertex set of G to integers 1,2, 3 until ,q+1 such that the induced function f of edge e equal u,v is defined by root square mean of u dan v is an injection function. For each vertex v on a graph G, take a new vertex v0. Join v0 to all vertices on G adjecent to v. The graph S(G) thus obtained is called the splitting graph of G. In this paper, we detemine a root square mean labeling of disjoint union of paths and the middle graph.
Keywords: graph, graph labeling, root square mean labeling, path
