| 具有6个顶点且匹配数为1的极值3-一致超图的结构 |
| |
| 引用本文： | 石玉杰,李国全.具有6个顶点且匹配数为1的极值3-一致超图的结构[J].天津师范大学学报(自然科学版),2014,34(4):22-24. |
| |
| 作者姓名： | 石玉杰 李国全 |
| |
| 作者单位： | 大津师范大学数学科学学院,天津,300387 |
| |
| 摘 要： | 设H为一个具有6个顶点且匹配数为1的极值3-一致超图,由生成函数法确定了根序列的数目,进一步确定了极图同构类的总数为13,并详尽描述了各类极图的结构.
|
| 关 键 词： | 一致超图 匹配数 度序列 |
Structure of 3-uniform extremal hypergraphs with 6 vertexes and 1-matching |
| |
| SHI Yujie,LI Guoquan.Structure of 3-uniform extremal hypergraphs with 6 vertexes and 1-matching[J].Journal of Tianjin Normal University(Natural Science Edition),2014,34(4):22-24. |
| |
| Authors: | SHI Yujie LI Guoquan |
| |
| Institution: | SHI Yujie;LI Guoquan;College of Mathematical Science,Tianjin Normal University; |
| |
| Abstract: | Let H be a 3-uninform extremal hypergraph with 6 vertexes and 1 -matching. By the method of generating function, the number of root sequence is determined, and then it is proved that the extremal hypergraphs have 13 isomorphic objects totally, and the structures of extremal hypergraphs are described at full length. |
| |
| Keywords: | uniform hypergraphs matching number degree sequence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
