Let be a graph with and are the set of its vertices and edges, respectively. Total edge
irregular-labeling on is a map from to satisfies for any two distinct edges have distinct …

For a simple graph G=(V (G), E (G)), a total labeling∂ is called an edge irregular total k-
labeling of G if∂: V (G)∪ E (G)→{1, 2,..., k} such that for any two different edges uv and u'v'in …

In the context of a finite undirected graph $\zeta $, an edge irregular labelling is defined as a
labelling of its vertices with some labels in such a way that each edge has a unique weight …

The k-token graph of a given graph G, is the graph which vertex set consists of all k− subsets
of the vertex set of G and two vertices are connected by an edge exactly when their …