Abstract
The modified Albertson index, denoted by , of a graph is defined as , where , denote the degrees of the vertices , , respectively, of and is the edge set of . In this note, a sharp lower bound of in terms of the maximum degree for the case of trees is derived. The -vertex trees having maximal and minimal values are also characterized here. Moreover, it is shown that is non-negative even integer for every graph and that there exist infinitely many connected graphs whose value is for every integer .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.