Computing the Omega polynomial of an infinite family of the linear parallelogram P(n,m)

Authors

  • Mohammad Reza Farahani Iran University of Science and Technology (IUST), Narmak, Tehran 16844

DOI:

https://doi.org/10.24297/jac.v2i2.900

Keywords:

Molecular graph, linear parallelogram, Omega polynomial, qoc strip

Abstract

Let G=(V,E) be a molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. The Omega polynomial Ω(G,x) was introduced by Diudea in 2006 and this defined as  where m(G,c) the number of qoc strips of length c. In this paper, we compute the omega polynomial of an infinite family of the linear parallelogram P(n,n) of benzenoid graph.

Downloads

Download data is not yet available.

Author Biography

Mohammad Reza Farahani, Iran University of Science and Technology (IUST), Narmak, Tehran 16844

Department of Applied Mathematics

Downloads

Published

2006-08-07

How to Cite

Farahani, M. R. (2006). Computing the Omega polynomial of an infinite family of the linear parallelogram P(n,m). JOURNAL OF ADVANCES IN CHEMISTRY, 2(2), 106–109. https://doi.org/10.24297/jac.v2i2.900

Issue

Vol. 2 No. 2 (2013)

Section

Articles

License

Creative Commons License All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.