It is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to the number of subgraphs of the resonance graph of B isomorphic to the Cl(B)-dimensional hypercube, where Cl(B) is the Clar number of B.

A matching M of a graph G is maximal if it not proper subset any other in G. Maximal matchings are much less known and researched than their maximum perfect counterparts. In this paper we present the recurrences generating functions for sequences enumerating two classes chemically interesting linear polymers: polyspiro chains benzenoid chains. We also analyze asymptotic behavior those determine...

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

Zagreb indices belong to better known and better researched topological indices. We investigate here their ability to discriminate among benzenoid graphs and arrive at some quite unexpected conclusions. Along the way we establish tight (and sometimes sharp) lower and upper bounds on various classes of benzenoids.