Abstract
The first Zagreb index \(M_1\) of a graph \(G\) is equal to the sum of squares of the vertex degrees of \(G\). The repetition number of a graph is the maximum multiplicity in the list of its vertex degrees. In this note, we bound the first Zagreb index of a tree from both below and above by expressions depending solely on its repetition number.
