A k-labeling from the vertex set of a simple graph G=(V, E) to a set of integers {1, 2,…, k} is
defined to be a modular edge irregular if, for every couple of distinct edges, their modular …

Edge irregular mapping or vertex mapping β: V (U)−→{1, 2, 3,..., s} is a mapping of vertices
in such a way that all edges have distinct weights. We evaluate weight of any edge by using …

One of the extremely useful branches in graph theory is the labeling of a graph. Graph
labeling plays a vital role in many fields such as database management, astronomy, coding …

On total edge irregularity strength for some special types of uniform Page 1 AIMS Mathematics,
6(8): 8127–8148. DOI: 10.3934/ math.2021471 Received: 18 February 2021 Accepted: 16 …

This article comprises of exact valuation of a graph parameter, known as the edge
irregularity strength (EIS), symbolized as eis (G), of various graphical families such as …

For a simple graph $ G $, a vertex labeling $\phi: V (G)\rightarrow\{1, 2,\ldots, k\} $ is called $
k $-labeling. The weight of an edge $ xy $ in $ G $, written $ w_ {\phi}(xy) $, is the sum of the …

Resumen IMRAN, Muhammad; CANCAN, Murat; NADEEM, Muhammad Faisal y ALI, Yasir.
Further results on edge irregularity strength of some graphs. Proyecciones …

For a graph G, we define a total k-labeling ϕ as a combination of an edge labeling ϕe
(x)→{1, 2,..., ke} and a vertex labeling ϕv (x)→{0, 2,..., 2kv}, such that ϕ (x)= ϕv (x) if x∈ V …

Given a graph B=(V (B), E (B)) with the vertex set V (B) and the edge set E (B). A vertex
labelling of a simple, connected, and undirected B, g: V (B)→{1, 2,..., q} is called an edge …

In different fields in our life, like physics, coding theory and computer science, graph labeling
dramas an vital role and appears in many applications. A labeling of a graph is a map which …