Irregular labelings of circulant graphs (Q1761466)

Let \(G=(V,E)\) be an edge-labeled graph with \(w(e)>0\) being an integer for each edge \(e\in E\). Then the weighted degree \(wd(v)\) of a vertex \(v\in V\) is given by \(wd(v)=\sum_{e\backepsilon v}w(e)\). The edge labeling is called irregular if all vertices in \(V\) have distinct weighted degrees; and the smallest \(s\) so that there exists an irregular labelling with \(wd(v)\leq s\) for each \(v\in V\) is called the irregularity strength of \(G\). In the paper the irregular strength of circular graphs is determined.