Indexed metadata
A New Upper Bound for the Irregularity Strength of Graphs
M. Kalkowski, M. Karoński, F. Pfender
Source abstract
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 [Formula: see text] for all graphs not containing a component with exactly two vertices or two isolated vertices.
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.