Browsing by Author "Ali, Y."

Now showing 1 - 4 of 4

Further Results on Edge Irregularity Strength of Some Graphs
(Universidad Catolica del Norte, 2024) Imran, M.; Cancan, M.; Nadeem, M.F.; Ali, Y.
The focal point of this paper is to ascertain the precise value of edge irregularity strength of various finite, simple, undirected and captivating graphs, including the splitting graph, shadow graph, jewel graph, jellyfish graph and m copies of 4-pan graph. © (2024), (Universidad Catolica del Norte). All rights reserved.
On Edge Irregularity Strength of Certain Families of Snake Graph
(Abdus Salam School of mathematical Sciences, 2023) Nadeem, M.F.; Cancan, M.; Imran, M.; Ali, Y.
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 equation wtβ(cd) =β(c)+β(d), ∀c, d ∈ V (U) and cd ∈ E(U). Edge irregularity strength denoted by es(U) is a minimum positive integer used to label vertices to form edge irregular labeling. The aim of this paper is to determine the exact value of edge irregularity strength of different families of snake graph. © (2023). All Rights Reserved.
On Edge Irregularity Strength of Different Families of Graphs
(Universidad Catolica del Norte, 2023) Imran, M.; Cancan, M.; Ali, Y.; Anum,; Aslam, J.
Edge irregular mapping or vertex mapping h: V (G) −→ {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 equation wth(cd) = h(c) + h(d), ∀c, d ∈ V (G) and ∀cd ∈ E(G). Edge irregularity strength denoted by es(G) is a minimum positive integer used to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of linear phenylene graph PHn, Bn graph and different families of snake graph. © (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.
Some Comb Related Mean Graphs
(Palestine Polytechnic University, 2024) Imran, M.; Cancan, M.; Ali, Y.
A graph Z(V, E) with p vertices and q edges is categorized as mean graph if there is an injective function δ: V (Z) →{0, 1, 2, …, q} such that the weights {1, 2, …, q} of all edges are distinct. Weight of each edge uv can be calculated by equation [Formula Presented]. In this paper, we prove that different families of comb graph are mean graphs. © Palestine Polytechnic University-PPU 2024.