图的二维带宽及其Laplacian特征值(英文)  

2-Dimensional Bandwidth and the Laplacian Eigenvalues of Graphs

作　　者：肖恩利[1] 束金龙[1] 闻人凯[1] 

机构地区：[1]华东师范大学数学系,上海200062

出　　处：《运筹学学报》2002年第1期45-52,共8页Operations Research Transactions

基　　金：Supported by National Natural Science Foundation of China(19971027); Foundation of University Key Teacher by the Ministry of Education, P. R. C.

摘　　要：图的二维带宽问题是将图G嵌入平面网格图,并使基于该嵌入的函数取得最优值（通常是最小值）.本文研究了图的二维带宽与其Laplacian特征值之间的关系.The 2-dimensional bandwidth problem may be stated as follows: Given a graph G, find an embedding of it in the grid graph, such that a certain function based on the chosen embedding will attain its optimal (usually minimum). In this paper we study the relationship between the 2-dimensional bandwidth and the Laplacian eigenvalues of a graph.

关 键 词：图 二维带宽 LAPLACIAN特征值 最优嵌入 简单图 有限图 无向图 

分 类 号：O157.5[理学—数学]