| 图的二维带宽及其Laplacian特征值 |
| |
| 引用本文： | 肖恩利,束金龙,闻人凯. 图的二维带宽及其Laplacian特征值[J]. 运筹学学报, 2002, 6(1): 45-52 |
| |
| 作者姓名： | 肖恩利 束金龙 闻人凯 |
| |
| 作者单位： | 华东师范大学数学系,上海,200062 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China(19971027)，Foundation of University Key Teacher by the Ministry of Education, P. R. C. |
| |
| 摘 要： | 图的二维带宽问题是将图G嵌入平面网格图，并使基于该嵌入的函数取得最优值（通常是最小值）。本文研究了图的二维带宽与其Laplacian特征值之间的关系。
|
| 关 键 词： | 图 二维带宽 Laplacian特征值 最优嵌入 简单图 有限图 无向图 |
2-Dimensional Bandwidth and the Laplacian Eigenvalues of Graphs |
| |
| ENLI XIAO JINLONG SHU KAI WENREN. 2-Dimensional Bandwidth and the Laplacian Eigenvalues of Graphs[J]. OR Transactions, 2002, 6(1): 45-52 |
| |
| Authors: | ENLI XIAO JINLONG SHU KAI WENREN |
| |
| Abstract: | 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. |
| |
| Keywords: | 2-dimensional bandwidth Laplacian eigenvalue optimal embedding. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
