六个苯环生成的六角系统的自由度
The Degrees of Freedom of a Hexagonal Systems Generated by Six Benzene Rings
DOI: 10.12677/AAM.2023.1210440, PDF, 下载: 204  浏览: 243  国家自然科学基金支持
作者: 刘乙瑾, 邓 凯*：北方民族大学，数学与信息科学学院，宁夏 银川
关键词: 完美匹配；强迫数；六角系统；自由度；Perfect Matching； Forcing Number； Hexagonal System； Degree of Freedom
摘要: 设 M 是图 G 的一个完美匹配，S 是 M 的一个子集。 若 S 不被 G 中其它完美匹配所包含，则称 S 是 M 的一个强迫集。 包含边数最少的强迫集的势称为 M 的强迫数，图 G 中所有完美匹配的强 迫数的和称作图 G 的自由度。 图的强迫多项式是最近提出的刻画全体强迫数分布的一种计数多项 式。 在本文中，利用强迫多项式，计算了所有由六个苯环生成的六角系统的自由度，井对比了它 们的平均自由度。
Abstract: Let M be a perfect matching of a graph G, and S be a subset of M . S is called a forcing set of M if S is not contained in other perfect matchings of G. The cardinality of a forcing set with the least number of edges is defined as the forcing number of M . The sum of forcing numbers of all perfect matchings of G is called the degree of freedom of G. The forcing polynomial of a graph is a recently proposed counting polynomial that characterizes the distribution of all forcing numbers. In this paper, the degrees of freedom of all hexagonal systems generated by six benzene rings were calculated using forcing polynomials, and their average degrees of freedom were compared.
文章引用：刘乙瑾, 邓凯. 六个苯环生成的六角系统的自由度[J]. 应用数学进展, 2023, 12(10): 4490-4500. https://doi.org/10.12677/AAM.2023.1210440

参考文献

[1] Lovasz, L. and Plummer, M.D. (2009) Matching Theory. AMS Chelsea Publishing, Providence.
[2] Cyvin, S.J. and Gutman, I. (1988) Kekul´e Structures in Benzenoid Hydrocarbons. Springer, Berlin.
[3] Klein, D.J. and Randi´c, M. (1987) Innate Degree of Freedom of a Graph. Journal of Compu- tational Chemistry, 8, 516-521.
https://doi.org/10.1002/jcc.540080432
[4] Harary, F., Klein, D.J. and Zˇivkovi´c, T. (1991) Graphical Properties of Polyhexes: Perfect Matching Vector and Forcing. Journal of Mathematical Chemistry, 6, 295-306.
https://doi.org/10.1007/BF01192587
[5] Adams, P., Mahdian, M. and Mahmoodian, E.S. (2004) On the Forced Matching Numbers of Bipartite Graphs. Discrete Mathematics, 281, 1-12.
https://doi.org/10.1016/j.disc.2002.10.002
[6] Afshani, P., Hatami, H. and Mahmoodian, E.S. (2004) On the Spectrum of the Forced Match- ing Number of Graphs. The Australasian Journal of Combinatorics, 30, 147-160.
[7] Zhang, H.P., Zhao, S. and Lin, R.Z. (2015) The Forcing Polynomial of Catacondensed Hexag- onal Systems. MATCH Communications in Mathematical and in Computer Chemistry, 73, 473-490.
[8] Vukiˇcevi´c, D. and Randi´c, M. (2005) On Kekul´e Structures of Buckminsterfullerene. Chemical Physics Letters, 401, 446-450.
https://doi.org/10.1016/j.cplett.2004.11.098
[9] Randi´c, M. and Vukiˇcevi´c, D. (2006) Kekul´e Structures of Fullerene C70. Croatica Chemica Acta, 79, 471-481.
[10] Vukiˇcevi´c, D., Gutman, I. and Randi´c, M. (2006) On Instability of Fullerene C72. Croatica Chemica Acta, 79, 429-436.
[11] Zhao, S. and Zhang, H.P. (2016) Forcing Polynomials of Benzenoid Parallelogram and Its Related Benzenoids. Applied Mathematics and Computation, 284, 209-218.
https://doi.org/10.1016/j.amc.2016.03.008
[12] Deng, K., Liu, S.H. and Zhou, X.Q. (2021) Forcing and Anti-Forcing Polynomials of Perfect Matching of a Pyrene System. MATCH Communications in Mathematical and in Computer Chemistry, 85, 27-46.
[13] Deng, K., Lu¨, H.Z. and Wu, T.Z. (2023) Forcing and Anti-Forcing Polynomials of a Type of Polyomino Graphs. Computational and Applied Mathematics, 42, Article 91.
https://doi.org/10.1007/s40314-023-02228-7
[14] 邓凯. 线性亚苯基系统的强迫和反强迫多项式[J]. 高校应用数学学报(A辑), 2022, 37(4):491-500.
[15] Dias, J.R. (2008) Isomer Enumeration of Practical Benzenoids. Journal of Mathematical Chem- istry, 44, 711-724.
https://doi.org/10.1007/s10910-007-9343-6
[16] Brunvoll, J., Cyvin, S.J. and Cyvin, B.N. (1987) Enumeration and Classification of Benzenoid Hydrocarbons. Journal of Computational Chemistry, 8, 189-197.
https://doi.org/10.1002/jcc.540080301
[17] Konp, J.V., Szymanski, K., Jeriˇcevi´c, Zˇ. and Trinajsti´c, N. (1984) On the Total Number of Polyhexes. MATCH Communications in Mathematical and in Computer Chemistry, 16, 119- 134.
[18] Pachter, L. and Kim, P. (1998) Forcing Matchings on Square Grids. Discrete Mathematics, 190, 287-294.
https://doi.org/10.1016/S0012-365X(97)00266-5
[19] Zhang, H.P. and Zhang, F.J. (2000) Plane Elementary Bipartite Graphs. Discrete Applied Mathematics, 105, 291-311.
https://doi.org/10.1016/S0166-218X(00)00204-3

为你推荐