谱图理论是图论的重要研究分支,其思想广泛应用于计算机科学的各个领域.带权图Lap lac ian矩阵的次小特征根λn-1的估计被应用于在图像分割和图数据表示中.用代数方法对λn-1的下界进行估计,并讨论非带权图情况下λn-1的下界.
Spectral graph theory is an important research branch of graph theory,which is widely used in various areas of computer science.Estimated the second smallest eigenvalue λn-1 of Laplacian matrix of weighted graph has been used in image segmentation and data representation on graph.It gives the lower bound of λn-1 by using algebra method,and discusses the case of non-weighted graph.