含一个割点的连通图的最小特征值

一个图的无符号拉普拉斯最小特征值在某个图类中的所有图中达到最大时常称为极大图;通过利用特征向量方程研究特征值的方法,对只含有一个割点的连通图的无符号拉普拉斯最小特征值进行了研究,且得到了最小特征值的值,从而得到了只含有一个割点的具有相同阶数的所有的连通图中最小特征值的极大值,并且刻画了最小特征值取到极大值时所对应的极大图的结构.

The Least Eigenvalues of Connected Graphs with Only One Cut Vertex

The graph with maximum least eigenvalue of signless Laplacian among all the graphs in a certain class is often called maximized graph.We obtain the value of the least eigenvalue of signless Laplacian of connected graph with only one cut vertex by the way of using eigenvector equation to study eigenvalue.Furthermore,we get the maximum of least eigenvalue of signless Laplacian of all the connected graphs of the same order with only one cut vertex and depict corresponding structure of the maximizing graph with maximum of least eigenvalue of signless Laplacian.