富勒烯图是3-连通3-正则平面图,并且恰好具有12个五边形面,其余的面都是六边形面。本文研究的富勒烯图是由六个同心的六边形层组成,两端都由一个六边形以及与这个六边形相邻的六个五边形面构成的顶盖封口。我们把该类富勒烯图称为管状...富勒烯图是3-连通3-正则平面图,并且恰好具有12个五边形面,其余的面都是六边形面。本文研究的富勒烯图是由六个同心的六边形层组成,两端都由一个六边形以及与这个六边形相邻的六个五边形面构成的顶盖封口。我们把该类富勒烯图称为管状富勒烯图。完美匹配计数在量子化学领域以及统计物理领域中具有广泛的应用,并且已被证实完美匹配计数问题是一个NP-难的问题。本文主要通过划分、求和以及嵌套递推的方式求出管状富勒烯图的完美匹配数。A fullerene graph is 3-connected cubic planar graph, and has exactly 12 pentagonal faces, the rest of which are hexagonal faces. The fullerene graph studied in this paper is composed of six concentric layers of hexagons, capped on each end by a cap formed by a hexagon and six pentagonal faces adjacent to the hexagon. This kind of fullerene graphs is called tubular fullerene graphs. The problem of counting the number of perfect matching is widely used in the field of quantum chemistry and statistical physics, and it has been proved that the problem of counting the number of perfect matching is NP-hard. In this paper, the number of perfect matching of tubular fullerene graphs is obtained by means of partition, summation and nested recursion.展开更多
Woodall 所引入的一个图 G 的联结数 bind(G)是|ΓG(×)|/|×|的最小值,其中×遍取V(G)的所有子集(×≠φ).ΓG(×)表示 G 中×的邻点集(ΓG(×)≠V(G)).本文得到了θ图θ_(r,s,t)及其线圈的联结数:(1)若 n...Woodall 所引入的一个图 G 的联结数 bind(G)是|ΓG(×)|/|×|的最小值,其中×遍取V(G)的所有子集(×≠φ).ΓG(×)表示 G 中×的邻点集(ΓG(×)≠V(G)).本文得到了θ图θ_(r,s,t)及其线圈的联结数:(1)若 n=r+s+t-1是偶数,则 bind(θ_(r,s,t)=1.(2)若 n 是奇数:当 r,s,t 均为偶数时,bind(θ_(r,s,t))=(r+s+t-2)/r+s+t;否则,bind(θ_(r,s,t,)=(r+s+t-2)/r+s+t-3.(3)若 r,s,t 中至少有一个大于2,则 bind(L(θ_(r,s,t,)=(r+s+t-1)/r+s+t-2.展开更多
文摘富勒烯图是3-连通3-正则平面图,并且恰好具有12个五边形面,其余的面都是六边形面。本文研究的富勒烯图是由六个同心的六边形层组成,两端都由一个六边形以及与这个六边形相邻的六个五边形面构成的顶盖封口。我们把该类富勒烯图称为管状富勒烯图。完美匹配计数在量子化学领域以及统计物理领域中具有广泛的应用,并且已被证实完美匹配计数问题是一个NP-难的问题。本文主要通过划分、求和以及嵌套递推的方式求出管状富勒烯图的完美匹配数。A fullerene graph is 3-connected cubic planar graph, and has exactly 12 pentagonal faces, the rest of which are hexagonal faces. The fullerene graph studied in this paper is composed of six concentric layers of hexagons, capped on each end by a cap formed by a hexagon and six pentagonal faces adjacent to the hexagon. This kind of fullerene graphs is called tubular fullerene graphs. The problem of counting the number of perfect matching is widely used in the field of quantum chemistry and statistical physics, and it has been proved that the problem of counting the number of perfect matching is NP-hard. In this paper, the number of perfect matching of tubular fullerene graphs is obtained by means of partition, summation and nested recursion.
