Main Article Content
Abstract
Difference labelings of a graph C are acknowledged by appointing unmistakable whole number qualities to every vertex and afterward connecting with each edge the supreme distinction of those qualities doled out to its end vertices. A decomposition of a labeled graph into parts, each part containing the edges having a typical weight is known as a typical weight decomposition. Right now explore the presence of labelings for cycles, cartesian result of two graphs, rn-crystals, rectangular matrices and n-solid shapes which deteriorate these graphs into indicated parts. We likewise examine the comparing issue for added substance labelings.