The complete forcing number of polyphenyl systems
The complete forcing number of polyphenyl systems
复制标题
聚苯体系的完整受力数
DOI:
--
复制
发表时间:
2016
影响因子:
1.3
通讯作者:
Haizheng Yu
中科院分区:
文献类型:
--
作者:
Bingjie Liu;Hong Bian;Haizheng Yu
The idea of “forcing” has long been used in many research fields, such as.colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin.squares, block designs and Steiner systems in combinatorics [D. Donovan, E. S..Mahmoodian, C. Ramsay, A. P. Street, Defining sets in combinatorics: A survey, in: C..D. Wensley (Ed.), Surveys in Combinatorics, Cambridge Univ. Press, 2003, pp..115174]. Recently, the forcing on perfect matchings has been attracting more.researchers’ attention. A forcing set of a perfect matching M of a graph G is a subset of.M contained in no other perfect matchings of G. A global forcing set of G, introduced by.Vukičević et al., is a subset of E(G) on which there are distinct restrictions of any two.different perfect matchings of G. Combining the above “forcing” and “global” ideas. Xu.et al. in [Complete forcing numbers of catacondensed benzenoid, J. Combin. Optim. 29.(2015) 803814.] introduced a complete forcing set of G defined as a subset of E(G) on.which the restriction of any perfect matching M of G is a forcing set of M. The minimum.cardinality of complete forcing sets is the complete forcing number of G. In this paper,.we give the explicit expressions for the complete forcing number of several classes of.polyphenyl systems.