This is the authors' abstract. We don't add key points for this paper.
An k-edge-weighting of a graph G=(V,E) is a map φ: E(G) → {1, 2, 3, ..., k} where k ≥ 1 is an integer. Denote Sφ(v) is the sum of edge-weights appearing on the edges incident at the vertex v under φ. An k-edge-weighting of G is equitable irregular if |Sφ (u)−Sφ (v)| ≤ 1, for every pair of adjacent vertices u and v in G. Theequitable irregular strength of an equitable irregular graph G is the smallest positive integer k such that there is a k-edge weighting of G and is denoted by Se (G). In this paper, we discuss the equitable irregularity of Polar grid and Mongolian tent graphs
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Gayathri et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: