版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Tech Univ Chemnitz Fak Math D-09107 Chemnitz Germany
出 版 物:《OPERATIONS RESEARCH LETTERS》 (运筹学快报)
年 卷 期:2010年第38卷第4期
页 面:320-321页
核心收录:
学科分类:1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:Spectral graph theory Semidefinite programming Eigenvalue optimization Embedding Graph partitioning
摘 要:The second smallest eigenvalue of the Laplace matrix of a graph and its eigenvectors, also known as Fiedler vectors in spectral graph partitioning, carry significant structural information regarding the connectivity of the graph. Using semidefinite programming duality, we offer a geometric interpretation of this eigenspace as optimal solution to a graph realization problem. A corresponding interpretation is also given for the eigenspace of the maximum eigenvalue of the Laplacian. (C) 2010 Elsevier B.V. All rights reserved.