Research Output | Dar Al-hikmah Library | IIUM Only
Given a graph �with vertex set V and edge set E, we define a labeling as a function, where weight of edge xy is written as �Total labeling is the sum of xy-label and labels of the vertices that incident to x, thus �l labeling is called as edge irregular total k-labeling of the graph G if for every two different edges e and f of G, �The smal