Forcing polynomials of benzenoid parallelogram and its related benzenoids

Shuang Zhao and Heping Zhang

Applied Mathematics and Computation, 2016, vol. 284, issue C, 209-218

Abstract: Klein and Randić introduced the innate degree of freedom (forcing number) of a Kekulé structure (perfect matching) M of a graph G as the smallest cardinality of subsets of M that are contained in no other Kekulé structures of G, and the innate degree of freedom of the entire G as the sum over the forcing numbers of all perfect matchings of G. We proposed the forcing polynomial of G as a counting polynomial for perfect matchings with the same forcing number. In this paper, we obtain recurrence relations of the forcing polynomial for benzenoid parallelogram and its related benzenoids. In particular, for benzenoid parallelogram, we derive explicit expressions of its forcing polynomial and innate degree of freedom by generating functions.

Keywords: Forcing polynomial; Perfect matching; Innate degree of freedom; Forcing number; Benzenoid (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316302004
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:284:y:2016:i:c:p:209-218

DOI: 10.1016/j.amc.2016.03.008

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().