On the \(D_\alpha\)-spectral radius of cacti and bicyclic graphs (Q2092355)

For a connected graph \(G\), the \(D_\alpha\)-matrix is defined by \(D_\alpha(G) = \alpha Tr(G) +(1-\alpha) D(G)\), where \(D(G)\) is the distance matrix and \(Tr(G)\) is the diagonal matrix whose diagonal entry corresponding to a vertex is the sum of distances to all the other vertices. The largest eigenvalue of \(D_\alpha(G)\) is called the \(D_\alpha\)-spectral radius of \(G\). In this paper, the authors found extremal graphs having minimal \(D_\alpha\)-spectral radius among the cacti of order \(n\) with \(k\) \((k\ge 1)\) cycles and at least one pendant vertex, and among the bicyclic graphs having a certain condition. The main technique is the Perron-Frobenius theorem. They found certain transformations of graphs with decrease the \(D_\alpha\)-spectral radius.