偶一致超图划分问题的若干结果  

Some results on partition problems of even uniform hypergraphs

作　　者：鄢仁政[1] 

机构地区：[1]福建江夏学院数理教研部,福建福州350108

出　　处：《纯粹数学与应用数学》2014年第1期40-44,共5页Pure and Applied Mathematics

基　　金：福建省中青年教师教育科研项目(JB13194)

摘　　要：划分问题因其在多个领域的重要应用一直是图论的研究热点.利用张量的特征值研究超图的划分与奇划分,并结合边割的界给出最大奇割、平均最小割、等周数等超图拓扑指标的界.当k取2时,这些结果与对应的图谱理论中的经典结论一致,因此可视为这些结论在超图的推广.Because of the widespread applications in many fields, partition problems play an important role in graph theory. We study partition and odd-partition problems of hypergraphs by eigenvalues of the Laplacian tensor. Joined with the bound for cardinality of edge cuts, we introduce some bounds for max-odd-cut, averaged minimal cut and isoperimetric number of hypergraphs. These bounds generalize, to the case of hypergraphs, some classical results in spectral graph theory.

关 键 词：超图 划分 张量 特征值 

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