Among several theoretical tools available for investigating the molecular structure, there is
always a balance between simplicity and reliability. While detailed electronic structure …

We demonstrate on multiple examples that Zhang-Zhang (ZZ) polynomials of benzenoids
with k peaks and k valleys can be computed as determinants of certain k× k matrices. The …

Graphene oxide exhibits extensive disorder with a multitude of functional groups and holes
making its structure an abstract concept. Multiple structural models make it a dark horse and …

Graphene Oxide (GO) remains a perennial chemical enigma despite its utility in preparing
graphene and its functionalization. Epoxides and tertiary alcohols are construed as primary …

Decision-making is an ongoing process for humankind. Many of these real-world decisions
can be modeled using the problems contained in the generalized area of combinatorial …

A matching of a graph is an independent subset of the edges set and a maximum matching
is a matching with as many edges in it as possible. The maximum weighted matching …

The sextet polynomial that counts different ways of selecting varying number of resonating
sextets on the hexagonal system is computed using a search based symbol manipulation …

A search based algorithm has been introduced by us [1] to generate all perfect matchings on
a graph. This paper presents a modified search that employs novel heuristics for rapid …

A Constraint Logic Programming Approach for Generating All Perfect Mat things Page 1
Mathematics Letters Applied Mathematics Letters 15 (2002) 969-973 www.elsevier.com/locate/aml …