Let G = (V, E) be a connected graph, where V = {v1, v2, …, vn}. Let di denote the degree of vertex vi. The ABC matrix of G is defined as M(G) = (mij)n × n, where if vivj ∈ E, and 0 otherwise. The ABC spectral radius of G is the largest eigenvalue of M(G). In the present paper, two graph perturbations with respect to ABC spectral radius are established. By applying these perturbations, the trees with the third, fourth, and fifth largest ABC spectral radii are determined.
Let G = (V, E) be a connected graph, where, and 0 otherwise. The ABC spectral radius of G is the largest eigenvalue of M (G). In the present paper, we establish two graph perturbations with respect to ABC spectral radius. By applying these perturbations, the trees with the third, fourth, and fifth largest ABC spectral radii are determined.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.