On Extended Adjacency Index with respect to Acyclic, Unicyclic and Bicyclic Graphs

Abstract

For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as equation . In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index. Also, we obtain the extremal acyclic, unicyclic and bicyclic graphs with minimum and maximum of the E A index by a unified method, respectively.