摘要
研究超图的直径,首先给出直径与拉普拉斯张量最大特征值的关系;其次给出直径与秩k的关系;最后给出直径为1的极小k-超图的边数的下界,并证明对任意的k,下界都是紧的.
The diameter of hypergraphs is studied in this paper. First of all, we introduce the relation be- tween the diameter and the maximal eigenvalue of the Laplacian tensor of hypergraphs. Secondly, we in- troduce the relation between the diameter and the rank of hypergraphs. Finally, we obtain a lower bound of the minimum number of edges of a k-hypergraph with diameter 1, moreover, we prove the bound is sharp for any given k.
出处
《闽江学院学报》
2013年第5期5-7,14,共4页
Journal of Minjiang University
基金
福建省中青年教师教育科研项目(JB13194)
闽江学院科研项目(YKQ1009)
福建省教育厅科技项目(JA12266)
关键词
超图
直径
张量
特征值
hypergraph
diameter
tensor
eigenvalue
