AbstractIn 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 by recurrence relations. We show that the number of aromatic sextets (in a Clar formula), the number of Clar formulas, the number of Kekulé structures and the first Herndon number for any Kekuléan hexagonal system can be easily obtained by its Clar covering polynomial. In addition, we give some theorems to calculate the Clar covering polynomial of a hexagonal system. As examples we finally derive the explicit expressions of the Clar covering polynomials for some small hexagonal systems and several types of catacondensed hexagonal systems. A relation between the resonance energy an...
A remarkably simple method is put forward for determining the Clar number CL ( = number of aromatic ...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
Glavno področje diplomskega dela je določitev grafov z enakim številom Clarovih struktur in Clarovih...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractA Clar structure is defined to be a maximal indepenent set of vertices of the Clar graph of ...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
Kekule structures are transformed into the subspace of their double bonds to yield the correspondiln...
A remarkably simple method is put forward for determining the Clar number CL ( = number of aromatic ...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
Glavno področje diplomskega dela je določitev grafov z enakim številom Clarovih struktur in Clarovih...
AbstractIn this paper the Clar covering polynomial of a hexagonal system is introduced. In fact it i...
AbstractThe Clar covering polynomial is a recently proposed concept of hexagonal systems by which so...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
AbstractSextet rotations of the perfect matchings of a hexagonal system H are represented by the sex...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractA Clar structure is defined to be a maximal indepenent set of vertices of the Clar graph of ...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractThis paper provides a combinatorial characterization for the class of graphs that model mole...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
Kekule structures are transformed into the subspace of their double bonds to yield the correspondiln...
A remarkably simple method is put forward for determining the Clar number CL ( = number of aromatic ...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
Glavno področje diplomskega dela je določitev grafov z enakim številom Clarovih struktur in Clarovih...