Computing topological polynomials of mesh-derived networks

Muhammad Imran, Abdul Qudair Baig, Shafiq Ur Rehman, Haidar Ali, Roslan Hasni

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


Topological descriptors are numerical parameters of a molecular graph which characterize its molecular topology and are usually graph invariant. In QSAR/QSPR study, physico-chemical properties and topological indices such as Randić, atom-bond connectivity (ABC) and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. The counting polynomials are those polynomials having at exponent the extent of a property partition and coefficients the multiplicity/occurrence of the corresponding partition. All of the studied interconnection mesh networks in this paper are motivated by the molecular structure of a Sodium chloride NaCl. In this paper, Omega, Sadhana and PI polynomials are computed for mesh-derived networks. These polynomials were proposed on the ground of quasi-orthogonal cut edge strips in polycyclic graphs. These polynomials count equidistant and non-equidistant edges in graphs. Moreover, the analytical closed formulas of these polynomials for mesh-derived networks are computed for the first time.

Original languageEnglish
Article number1850077
JournalDiscrete Mathematics, Algorithms and Applications
Issue number6
Publication statusPublished - Dec 1 2018


  • Counting polynomial
  • Omega polynomial
  • PI polynomial
  • Sadhana polynomial
  • mesh-derived network

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Computing topological polynomials of mesh-derived networks'. Together they form a unique fingerprint.

Cite this