超图的Laplacian(英文)

On the Laplacian of a Hypergraph

本文讨论了由Ｆ．Ｒ．Ｋ．Ｃｈｕｎｇ 引入的ｋ－图的Ｌａｐｌａｃｉａｎ 的一些基本性质．通过引入ｋ－图的邻接图的概念，得到了ｋ－图的Ｌａｐｌａｃｉａｎ 及其特征多项式的更明确的表达式．同时。

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.