On the number of Kekule structures of a type of oblate rectangles
type: Item
instance of: scholarly article
zbMATH Open document ID: 1265.05427
author: Weigen Yan
author: Fuji Zhang
publication date: 2012-09-21T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 6085323
zbMATH Keywords: hexagonal system
zbMATH Keywords: perfect matching
MaRDI profile type: Publication
title: On the number of Kekule structures of a type of oblate rectangles
published in: MATCH - Communications in Mathematical and in Computer Chemistry
review text: A hexagonal system is a finite connected (planar) graph without cut-vertices in which every interior face is a regular hexagon. Hexagonal systems are the natural graph representations of benzenoid hydrocarbons. A perfect matching of some graph is called (in chemistry) a Kekule structure. The number of Kekule structures in various types of hexagonal systems is extensively treated by chemists. Here the attention is focused on hexagonal systems of a type of oblate rectangles (any such graph is determined by two parameters, \(m\) and \(n\), and denoted by \(R^j(m,n)\)). Let \(\#R^j(m,n)\) be the number of Kekule structures in the corresponding graph. The main result of the authors is an explicit formulae for \(\#R^j(m,2^{n+1}-2)\) (\(n\geq 0\)). By using it, they also find that its limit value is \(\log 2\), when both \(m\) and \(n\) tend to \(\infty\).
description: scientific article; zbMATH DE number 6085323