The Clar Covering Polynomials of Plane Bipartite Graphs
DOI:
CSTR:
Author:
Affiliation:

1.School of Science, East China Jiaotong University, Nanchang 330013 , China ; 2.School of Mathematics andInformation Scienes, Yantai University, Yantai 264000 , China

Clc Number:

O157.5

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The Clar covering polynomial of molecular graphs is a method to characterize the electronic structure of conjugated systems. By studying the Clar covering polynomials of plane bipartite graphs, the resonance theory of related molecular graphs and their properties can be thoroughly investigated. Based on the theorem related to Clar covering polynomials of plane bipartite graphs, the method of generating functions is utilized to compute Clar covering polynomials of plane bipartite graphs. Recurrence relationship for Clar covering polynomials of a special class of graphs are derived. In turn, explicit expressions the Clar covering polynomials of two classes of catacondensed plane bipartite graphs are computed using the generating function method. On the Clar covering polynomials of plane bipartite graphs, it is possible to understand the electronic structure of chemical molecules, predict their chemical properties and reaction behavior, and design new molecular structures.

    Reference
    Related
    Cited by
Get Citation

刘莹,王广富,高新宇.平面二部图的Clar覆盖多项式[J].华东交通大学学报英文版,2025,42(1):120-126.
Liu Ying, Wang Guangfu, Gao Xinyu. The Clar Covering Polynomials of Plane Bipartite Graphs[J]. JOURNAL OF EAST CHINA JIAOTONG UNIVERSTTY,2025,42(1):120-126

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 24,2024
  • Revised:
  • Adopted:
  • Online: March 24,2025
  • Published:
Article QR Code