The Clar covering polynomials of plane bipartite graph
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    【Objective】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 related properties can be well studied.【Methods】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.【Results】Recurrence relations for Clar covering polynomials of a special class of graphs are derived. In turn, explicit expressions for the Clar covering polynomials of two classes of catacondensed plane bipartite graphs are computed using the generating function method.【Conclusion】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
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 04,2024
  • Revised:April 19,2024
  • Adopted:April 23,2024
  • Online: June 14,2024
  • Published:
Article QR Code