A note on edge irregularity strength of firefly graph
Umme Salma, H. M. Nagesh, D. Prahlad
Source record
Source: Crossref
Published: Mar 1, 2023
DOI: 10.7546/nntdm.2023.29.1.147-153
Open original source ↗Source abstract
Let be a simple graph. A vertex labeling is called -labeling. For an edge , the weight of , written , is the sum of the labels of and , i.e., . A vertex -labeling is said to be an edge irregular -labeling of if for every two distinct edges and , . The minimum for which the graph contains an edge irregular -labeling is known as the edge irregularity strength of and is denoted by $\es(G)$. In this paper, we find the exact value of edge irregularity strength of different cases of firefly graph for any .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.