| 超图的Laplacian |
| |
| 引用本文： | 常安. 超图的Laplacian[J]. 应用数学, 1999, 12(4): 93-97 |
| |
| 作者姓名： | 常安 |
| |
| 作者单位： | 福州大学数学系!350002 |
| |
| 摘 要： | 本文讨论了由Ｆ．Ｒ．Ｋ．Ｃｈｕｎｇ 引入的ｋ－图的Ｌａｐｌａｃｉａｎ 的一些基本性质．通过引入ｋ－图的邻接图的概念，得到了ｋ－图的Ｌａｐｌａｃｉａｎ 及其特征多项式的更明确的表达式．同时，也改进了文［１］中关于ｄ－正则ｋ－图的谱值的一个下界
|
| 关 键 词： | k-图 Laplacian 邻接图 谱值 界 |
On the Laplacian of a Hypergraph |
| |
| Chang An. On the Laplacian of a Hypergraph[J]. Mathematica Applicata, 1999, 12(4): 93-97 |
| |
| Authors: | Chang An |
| |
| Abstract: | In this paper, we discuss some basic properties of the Laplacian of k graph defined by F.R.K. Chung. By introducing the adjacency graph of a k graph, we shall get more explicit expression for the Laplacian of a k graph and its characteristic polynomial. At the same time, a lower bound for the spectral value of the d regular k graph in [1] is also improved. |
| |
| Keywords: | k-graph Laplacian Adjacency graph Spectral value Bound |
| 本文献已被 CNKI 维普 等数据库收录！ |
