The Clar covering polynomial of hexagonal systems. III (Q1971216): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:25, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Clar covering polynomial of hexagonal systems. III |
scientific article |
Statements
The Clar covering polynomial of hexagonal systems. III (English)
0 references
8 November 2000
0 references
[For Part I see Discrete Appl. Math. 69, No. 1-2, 147-167 (1996; Zbl 0859.05070).] Let \(H\) be a hexagonal system with a perfect matching. A Clar cover of \(H\) is a spanning subgraph each component of which is either a hexagon or an edge. The set of hexagons in a Clar cover is a resonant pattern of \(H\) and a resonant pattern with the maximum number \(C(H)\) of hexagons is a Clar formula; \(C(H)\) is the Clar number. The sextet polynomial \(B(H,x)= \sum_n s(H, n)x^n\) where \(s(H,n)\) is the number of resonant patterns with \(n\) hexagons. The Clar covering polynomial \(P(H, w)= \sum_n\sigma(H, n)w^n\) where \(\sigma(H, n)\) is the number of Clar covers with \(n\) hexagons. In this paper a relation is etablished between these two polynomials, a lower bound for the Clar number is obtained and some properties of the Clar covering polynomial are deduced.
0 references
hexagonal system
0 references
perfect matching
0 references
Clar cover
0 references
resonant pattern
0 references
Clar formula
0 references
Clar number
0 references
sextet polynomial
0 references
Clar covering polynomial
0 references