The Maximum Number of Alternating Hexagonal Faces in (4,6)-fullerenes
The Maximum Number of Alternating Hexagonal Faces in (4,6)-fullerenes
复制标题
(4,6)-富勒烯中交替六边形面的最大数量
DOI:
10.11845/sxjz.2020180b
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Heping Zhang
中科院分区:
文献类型:
--
作者:
Lingjuan Shi;Heping Zhang
A (4,6)-fullerene graph G is a connected plane cubic graph with only square and hexagonal faces,which is the molecular graph of possible boron-nitrogen fullerene or non-classical carbon fullerene.A perfect matching or a Kekule structure of G is a set of disjoint edges covering all vertices of G.An alternating set of G is a set of faces of G whose boundaries are M-alternating cycles for a perfect matching M of G.The size of a maximum alternating set is the Fries number.It is known that the Fries numbers of hexagonal systems and (4,6)-fullerenes are equal to their maximum anti-forcing numbers,respectively (see [Discrete Appl.Math.,2016,202:95-105] and [Discrete Appl.Math.,2017,233:187-194]).It is natural to consider the maximum size of alternating sets only including hexagonal faces in a (4,6)-fullerene G,which may be called the usual Fries number.In this paper we obtain a formula only depending on its order to count the usual Fries number of G.We also show that the usual Fries number of G is v(G)/3 if and only if G is a leapfrog (4,6)-fullerene.