| 偶一致超图划分问题的若干结果 |
| |
| 引用本文： | 鄢仁政.偶一致超图划分问题的若干结果[J].纯粹数学与应用数学,2014(1):40-44. |
| |
| 作者姓名： | 鄢仁政 |
| |
| 作者单位： | 福建江夏学院数理教研部,福建 福州350108 |
| |
| 基金项目： | 福建省中青年教师教育科研项目（JB13194）. |
| |
| 摘 要： | 划分问题因其在多个领域的重要应用一直是图论的研究热点.利用张量的特征值研究超图的划分与奇划分,并结合边割的界给出最大奇割、平均最小割、等周数等超图拓扑指标的界.当k取2时,这些结果与对应的图谱理论中的经典结论一致,因此可视为这些结论在超图的推广.
|
| 关 键 词： | 超图 划分 张量 特征值 |
Some results on partition problems of even uniform hypergraphs |
| |
| Yan Renzheng.Some results on partition problems of even uniform hypergraphs[J].Pure and Applied Mathematics,2014(1):40-44. |
| |
| Authors: | Yan Renzheng |
| |
| Institution: | Yan Renzheng (Department of Mathematics and Physics, Fujian Jiangxia University, Fuzhou 350108, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | hypergraph partition tensor eigenvalue |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
