加载中…
For a connected graph , let be the adjacency matrix of and be the diagonal matrix of the degrees of the vertices in . The -matrix of is defined as \begin{align*} A_α(G) = αD(G) + (1-α) A(G) \quad . \end{align*} The largest eigenvalue of is called the -spectral radius of . In this article, we characterize the graphs with maximum -spectral radius among the class of unicyclic and bicyclic graphs of order with fixed girth . Also, we identify the unique graphs with maximum -spectral radius among the class of unicyclic and bicyclic graphs of order with pendant vertices.

生成讲解博客的中文版本

生成AI智能校验的中文版本