Javascript must be enabled to continue!
The Multivariable Zhang–Zhang Polynomial of Phenylenes
View through CrossRef
The Zhang–Zhang polynomial of a benzenoid system is a well-known counting polynomial that was introduced in 1996. It was designed to enumerate Clar covers, which are spanning subgraphs with only hexagons and edges as connected components. In 2018, the generalized Zhang–Zhang polynomial of two variables was defined such that it also takes into account 10-cycles of a benzenoid system. The aim of this paper is to introduce and study a new variation of the Zhang–Zhang polynomial for phenylenes, which are important molecular graphs composed of 6-membered and 4-membered rings. In our case, Clar covers can contain 4-cycles, 6-cycles, 8-cycles, and edges. Since this new polynomial has three variables, we call it the multivariable Zhang–Zhang (MZZ) polynomial. In the main part of the paper, some recursive formulas for calculating the MZZ polynomial from subgraphs of a given phenylene are developed and an algorithm for phenylene chains is deduced. Interestingly, computing the MZZ polynomial of a phenylene chain requires some techniques that are different to those used to calculate the (generalized) Zhang–Zhang polynomial of benzenoid chains. Finally, we prove a result that enables us to find the MZZ polynomial of a phenylene with branched hexagons.
Title: The Multivariable Zhang–Zhang Polynomial of Phenylenes
Description:
The Zhang–Zhang polynomial of a benzenoid system is a well-known counting polynomial that was introduced in 1996.
It was designed to enumerate Clar covers, which are spanning subgraphs with only hexagons and edges as connected components.
In 2018, the generalized Zhang–Zhang polynomial of two variables was defined such that it also takes into account 10-cycles of a benzenoid system.
The aim of this paper is to introduce and study a new variation of the Zhang–Zhang polynomial for phenylenes, which are important molecular graphs composed of 6-membered and 4-membered rings.
In our case, Clar covers can contain 4-cycles, 6-cycles, 8-cycles, and edges.
Since this new polynomial has three variables, we call it the multivariable Zhang–Zhang (MZZ) polynomial.
In the main part of the paper, some recursive formulas for calculating the MZZ polynomial from subgraphs of a given phenylene are developed and an algorithm for phenylene chains is deduced.
Interestingly, computing the MZZ polynomial of a phenylene chain requires some techniques that are different to those used to calculate the (generalized) Zhang–Zhang polynomial of benzenoid chains.
Finally, we prove a result that enables us to find the MZZ polynomial of a phenylene with branched hexagons.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
One of the most important uses of the ring and field theory is an extension of a broader field so that a polynomial can be found to have roots. In this study researchers took modul...
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
MVMRmode: Introducing an R package for plurality valid estimators for multivariable Mendelian randomisation
MVMRmode: Introducing an R package for plurality valid estimators for multivariable Mendelian randomisation
Abstract
Background
Mendelian randomisation (MR) is the use of genetic variants as instrumental variables. Mode-based estimator...
MVMRmode: Introducing an R package for plurality valid estimators for multivariable Mendelian randomisation
MVMRmode: Introducing an R package for plurality valid estimators for multivariable Mendelian randomisation
Background
Mendelian randomisation (MR) is the use of genetic variants as instrumental variables. Mode-based estimators (MBE) are one of the most popular types ...
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our main contribution is...
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
ATTACHED PRIMES UNDER SKEW POLYNOMIAL EXTENSIONS
In the author's work [S. A. Annin, Attached primes over noncommutative rings, J. Pure Appl. Algebra212 (2008) 510–521], a theory of attached prime ideals in noncommutative rings wa...

