A hexagonal system (HS) is a finite connected plane graph with no cut-vertices in which every interior region is a hexagonal unit cell (Fig. 1). Let H be a HS.

In this paper we establish the validity of Ivan Gutman's conjecture concerning covers of hexagonal systems.

In this paper we establish the validity of Ivan Gutman's conjecture concerning covers of hexagonal systems.

The maximum number of hexagons in Clar covers of H is called Clar number of H, and denoted by C(H)[3-7]. The idea of a forcing number was inspired by practical ...

In this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it is a kind of F polynomial [4] of a graph, and can be calculated ...

... A Maximal Cover of Hexagonal Systems, Graphs. Combin. 1 (1985) 295-298. [10] Gutman, I., Covering Hexagonal Systems with Hexagons, Proceedings of the.

In this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it is a kind of F polynomial [4] of a graph, and can be calculated ...

Feb 8, 2021 · We present an upper bound on the complete forcing numbers of hexagonal systems in terms of elementary edge-cut cover and two lower bounds by ...

This paper establishes a relation between the Clar covering polynomial of hexagonal systems and chromatic polynomials. As applications, the explicit expressions ...

In this paper we show that for every perfect matching M of a hexagonal system H with the maximum anti-forcing number or minus one, a f ( H, M ) equals the ...