Prefer a chat interface with context about you and your work?
A New Upper Bound for the Irregularity Strength of Graphs
A weighting of the edges of a graph is called irregular if the weighted degrees of the vertices are all different. In this note we show that such a weighting is possible from the weight set for all graphs not containing a component with exactly two vertices or two isolated …