Abstract

The modified Albertson index, denoted by A ⁣∗ ⁣A\!^*\!, of a graph GG is defined as A ⁣∗ ⁣(G)=∑uv∈E(G)∣(du)2−(dv)2∣A\!^*\!(G)=\sum_{uv\in E(G)} |(d_{u})^{2}- (d_{v})^{2}|, where dud_u, dvd_v denote the degrees of the vertices uu, vv, respectively, of GG and E(G)E(G) is the edge set of GG. In this note, a sharp lower bound of A ⁣∗A\!^* in terms of the maximum degree for the case of trees is derived. The nn-vertex trees having maximal and minimal A ⁣∗A\!^* values are also characterized here. Moreover, it is shown that A ⁣∗ ⁣(G)A\!^*\!(G) is non-negative even integer for every graph GG and that there exist infinitely many connected graphs whose A ⁣∗A\!^* value is 2t2t for every integer t∈{0,3,4,5}∪{8,9,10,⋯ }t\in\{0,3,4,5\}\cup\{8,9,10,\cdots\}.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.