I-hedrite圖平面嵌入的唯一性
發(fā)布時間:2018-11-16 11:35
【摘要】:本文研究每一個面圈的圈長僅為2,3或4的無割點的4·正則連通平面圖,稱之為I-hedrite圖.證明在相等意義上,I-hedrite圖的平面嵌入是唯一的.這個唯一性結(jié)論意味著,兩個i-hedrite圖(即每一個面的度僅為2,3或4的4-正則連通平圖)是相等的當(dāng)且僅當(dāng)它們是同構(gòu)的,從而解決了i-hedrite圖的同構(gòu)構(gòu)造在相等意義上的唯一性問題.
[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.
【作者單位】: 漳州城市職業(yè)學(xué)院;
【分類號】: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.
【作者單位】: 漳州城市職業(yè)學(xué)院;
【分類號】:O157.5
【相似文獻(xiàn)】
相關(guān)期刊論文 前3條
1 劉彥佩;模2規(guī)劃與平面嵌入[J];應(yīng)用數(shù)學(xué)學(xué)報;1978年04期
2 劉彥佩;圖的平面性判定與平面嵌入[J];應(yīng)用數(shù)學(xué)學(xué)報;1979年04期
3 黃嘉培;陳慧;;一種簡單的圖的平面性判斷算法的實現(xiàn)研究[J];現(xiàn)代計算機(jī)(專業(yè)版);2012年07期
相關(guān)碩士學(xué)位論文 前1條
1 邢巧芳;平面嵌入曲線流問題的一些注記[D];華東師范大學(xué);2007年
,本文編號:2335407
本文鏈接:http://sikaile.net/kejilunwen/yysx/2335407.html
最近更新
教材專著