期刊文献+

点度和面度的最小值是3的连通平图 被引量:1

Connected Plane Graphs with min(δ_v,δ_f)=3
原文传递
导出
摘要 称一个连通平图是k||δ_(v,f^-)平图,若其顶点的最小度δ_v和面的最小度δ_f的最小值δ_(v,f)是k.本文研究3||δ_(v,f^-)平图.通过一个图运算构造证明链环分支数等于1的3||δ_(v,f^-)平图的存在性,并证明在相等意义下链环分支数不小于基圈数的3||δ_(v,f^-)平图是唯一的.然后证明在相等意义下,边数等于6,8的3||δ_(v,f^-)平图都是唯一的,边数等于9的3||δ_(v,f^-)平图有且只有两个且它们是互为对偶的.接着研究连通平图与其中间图在相等意义下的相互关系.作为运用,证明了无弓形链环图的三个唯一性结论. A connected plane graph G is called a k || δv,f-plane graph if δv,f=k.there,δv,f is the minimum value of δv,and δ,f,δv is the minimum degree of vertices of G and δf is the minimum degree of faces of G.We mainly study the 3||δv,f-plane graphs.We first prove the existence of the 3 || δv,f-plane graphs with the link component number 1 by constructing them via a graph operation,and prove the uniqueness of the3||δv,f-plane graph with link component number not less than nullity in the sense of equivalence.Then we prove the uniqueness of 3 || δv,f-plane graph with the edge number 6 and 8 in the sense of equivalence.We also show that there are only two3|| δv,f-plane graphs with the edge number 9 in the sense of equivalence,furthermore,they are dual.After that,we study the correlations between a connected plane graph and its medial graphs in the sense of equivalence.Finally,as applications,we prove three uniqueness conclusions of lune-free link graphs.
作者 林跃峰
出处 《数学学报(中文版)》 SCIE CSCD 北大核心 2014年第6期1061-1080,共20页 Acta Mathematica Sinica:Chinese Series
基金 福建省教育厅科技项目(JA11332 JB13366)
关键词 3||δ<sub>v f<sup>-</sup></sub>平图 链环分支数 无弓形链环图 3 ||δ_v,f-plane graphs link component number lune-free link graphs
  • 相关文献

参考文献6

  • 1林跃峰,金贤安.G-极大图和G-次极大图的构造与判定算法[J].数学进展,2013,42(6):817-822. 被引量:3
  • 2林跃峰.包含子图K_4的无割点次极大图的唯一性[J].数学的实践与认识,2013,43(10):156-160. 被引量:2
  • 3Yuefeng Lin,S.D. Noble,Xian’an Jin,Wenfang Cheng.On plane graphs with link component number equal to the nullity[J].Discrete Applied Mathematics.2011(9)
  • 4Xian’an Jin,Fengming Dong,Eng Guan Tay.On graphs determining links with maximal number of components via medial construction[J].Discrete Applied Mathematics.2009(14)
  • 5S. D.Noble,D. J. A.Welsh.Knot graphs[J].J Graph Theory.2000(1)
  • 6Dal-Young Jeong.Realizations with a cut-through Eulerian circuit[J].Discrete Mathematics.1995(1)

二级参考文献22

  • 1Tutte W T. A contribution to the theory Of chromatic polynomials [J]. Canad J Math, 1654, 6(1): 80-91.
  • 2Noble, S D, Welsh, D J A. Knot graphs [J]. J Graph Theory, 2000, 34(1): 100-111.
  • 3Godsll C, Royle G. Algebraic Graph Theory[M], Springer, 2001.
  • 4Shank H. The theory of left-right paths. Combinatorial Math [J]. III, Lecture Notes in Math, 1975 452: 42-54.
  • 5Eppstein D. On the parity of graph spanning tree numbers [R]. Tech. Report, Univ. of California, Irvine, Dept. of Information and Computer Science, 1996, 96-14.
  • 6JIN Xian-an, DONG Feng-ming, TAY Eng-guan.. number of components via medial construction [J]. 3110. On graphs determining links with maximal Discrete Appl Math, 2009, 156(14): 3099-.
  • 7LIN Yue-feng, Noble: S D. JIN Xian-an, CHENG Wen-fang. On plane graphs with link component number equal to the nullity [J]. Discrete Appl Math, 2012, 160(9): 1369-1375.
  • 8Pisanski, T, Tucker, T W. Zitnik, A. Straight-ahead walks in Eulerian graphs [J]. Discrete Math, 2004, 281(1-3): 237-246.
  • 9JIN Xian-an, DONG Feng-ming, TAY Eng-guan.. Determining the component number of links corresponding to lattices[J]. Journal of Knot Theory and its Ramifications, 2009, 18(12): 1711- J726.
  • 10JING Le-ping, JIN Xian-an, DENG Ke-cai.. Determining the component number of links corre- sponding to triangular and honeycomb lattices [J/OL]. Journal of Knot Theory and Its Ramifica- tions. In press, doi: 10.1142/S0218216511009765. 2012, 21(2), 1250018, 14 pages.

共引文献3

同被引文献4

  • 1Eliahou S,Harary F,Kauffman L H.Lune-free knot graphs[J].Journal of Knot Theory and Its Ramifications,2008,17(1):55-74.
  • 2Bondy J A,Murty U S R.Graph theory GTM244[M].Springer,2008.
  • 3Lipson A S.Link signature,Goeritz matrices and polynomial invariants[J].Enseign Math,1990,36:93-114.
  • 4Endo T.The link component number of suspended trees[J].Graphs and Combinatorics,2010,26:483-490.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部