[HTML][HTML] On the decomposition of circulant graphs using algorithmic approaches

A El-Mesady, YS Hamed, H Shabana - Alexandria Engineering Journal, 2022 - Elsevier
Many structural models in chemistry, biology, computer science, sociology, and operations
research can be analyzed using graph theory. Some examples of these structure models are …

A note on edge irregularity strength of Dandelion graph

HM Nagesh - arXiv preprint arXiv:2405.13252, 2024 - arxiv.org
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 …

[PDF][PDF] Computing the Edge Irregularity Strength of Some Classes of Grid Graphs

M Shahzad, R Hasni, I Tarawneh… - Malaysian Journal of …, 2024 - researchgate.net
Let G be a simple graph. A function ϕ: V (G)→{1, 2,..., k} a vertex k-labeling which assigns
labels to the vertices of G. For any edge xy in G, we define the weight of this edge as wϕ …

Computing Edge Irregularity Strength of Star and Banana Trees Using Algorithmic Approach

M Shahzad, MA Asim, R Hasni… - Ars Combinatoria, 2019 - combinatorialpress.com
After the Chartrand definition of graph labeling, since 1988 many graph families have been
labeled through mathematical techniques. A basic approach in those labelings was to find a …