I-hedrite图平面嵌入的唯一性
发布时间：2018-11-16 11:35
【摘要】：本文研究每一个面圈的圈长仅为2,3或4的无割点的4·正则连通平面图,称之为I-hedrite图.证明在相等意义上,I-hedrite图的平面嵌入是唯一的.这个唯一性结论意味着,两个i-hedrite图(即每一个面的度仅为2,3或4的4-正则连通平图)是相等的当且仅当它们是同构的,从而解决了i-hedrite图的同构构造在相等意义上的唯一性问题.
[Abstract]:In this paper, we study a 4-regular connected planar graph with no cut point for each circle whose cycle length is only 2 ~ 3 or 4, which is called a I-hedrite graph. It is proved that the plane embedding of a I-hedrite graph is unique in an equal sense. This uniqueness result means that two i-hedrite graphs (that is, 4-regular connected planar graphs with a degree of 2 ~ 3 or 4 of each surface) are equal if and only if they are isomorphic. Thus, the uniqueness problem of isomorphism construction of i-hedrite graphs in equal sense is solved.
【作者单位】： 漳州城市职业学院;
【分类号】：O157.5
本文编号：2335407
[Abstract]:In this paper, we study a 4-regular connected planar graph with no cut point for each circle whose cycle length is only 2 ~ 3 or 4, which is called a I-hedrite graph. It is proved that the plane embedding of a I-hedrite graph is unique in an equal sense. This uniqueness result means that two i-hedrite graphs (that is, 4-regular connected planar graphs with a degree of 2 ~ 3 or 4 of each surface) are equal if and only if they are isomorphic. Thus, the uniqueness problem of isomorphism construction of i-hedrite graphs in equal sense is solved.
【作者单位】： 漳州城市职业学院;
【分类号】：O157.5
【相似文献】
相关期刊论文 前3条
1 刘彦佩;模2规划与平面嵌入[J];应用数学学报;1978年04期
2 刘彦佩;图的平面性判定与平面嵌入[J];应用数学学报;1979年04期
3 黄嘉培;陈慧;;一种简单的图的平面性判断算法的实现研究[J];现代计算机(专业版);2012年07期
相关硕士学位论文 前1条
1 邢巧芳;平面嵌入曲线流问题的一些注记[D];华东师范大学;2007年
，本文编号：2335407
本文链接：https://www.wllwen.com/kejilunwen/yysx/2335407.html
