On the minimum reformulated Albertson Index of fixed-order trees and unicyclic graphs with a given maximum degree

The Albertson index [Formula: see text], traditionally based on vertex degrees, is defined as the sum of the absolute value of the differences in degrees between adjacent vertices. In this study, we introduce an edge version of this variant termed the reformulated Albertson index [Formula: see text], where the sum is taken over the absolute value of the differences in degrees between adjacent edges. We explore this index and establish a sharp lower bound for trees and unicyclic graphs, expressed in terms of the maximum degree and the number of pendant vertices attached to the vertex of the maximum degree. Additionally, we derive some upper bounds for the [Formula: see text] in terms of order, size, minimum, and maximum degree.

Abstract licence: CC BY-NC

11 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.