On the (Laplacian) spectral radius of unicyclic graphs with girth g and k pendant vertices
On the (Laplacian) spectral radius of unicyclic graphs with girth g and k pendant vertices
复制标题
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Liu Hui
中科院分区：
文献类型：
--
作者：
Liu Hui
图的谱半径是图的邻接矩阵的最大特征值，其拉普拉斯谱半径是拉普拉斯矩阵的最大特征值，拉普拉斯矩阵是顶点度对角矩阵与邻接矩阵的差。在本文中，我们分别确定了所有具有 k 个下垂顶点的 n 阶和周长 g 的单圈图中具有最大谱半径和最大拉普拉斯谱半径的单圈图。
The spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph and its Laplacian spectral radius is the largest eigenvalue of the Laplacian matrix which is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. In this paper, we determine the unicyclic graph with the maximal spectral radius and the maximal Laplacian spectral radius among all unicyclic graphs of order n and girth g with k pendant vertices, respectively.