The Number of Circles of a Maximum State of a Plane Graph with Applications  

作　　者：Xian-an JIN Jun GE Xiao Sheng CHENG Yu-qing LIN 

机构地区：[1]School of Mathematical Sciences,Xiamen University,Xiamen 361005 China [2]School of Mathematical Sciences&Laurent Mathematics Center,Sichuan Normal University,Chengdu610066,China [3]School of Mathematics and Statistics,Huizhou University,Huizhou,Guangdong 516007,China [4]School of Electrical Engineering and Computer Science,The Univesity of Newcastle,Callaghan,NSW 2308,Australia

出　　处：《Acta Mathematicae Applicatae Sinica》2021年第2期409-420,共12页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(Nos 11271307,11171279,11101174)。

摘　　要：Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links,in this paper,we introduce a parameter s_(max)(G),which is the maximum number of circles of states of the link diagram D(G)corresponding to a plane(positive)graph G.We show that s_(max)(G)does not depend on the embedding of G and if G is a 4-edge-connected plane graph then s_(max)(G)is equal to the number of faces of G,which cover the results of S.Y.Liu and H.P.Zhang as special cases.

关 键 词：plane graph number of circles special alternating link GENUS DNA polyhedral link 

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