Computing omega and sadhana polynomials of carbon nanotubes

Muhammad Imran, Sakander Hayat, Muhammad Kashif Shafiq

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Counting polynomials are those polynomials having at exponent the extent of a property partition and coefficients the multiplicity/occurrence of the corresponding partition. In this paper, omega and Sadhana polynomials are computed for nanotubes. These polynomials were proposed on the ground of quasi-orthogonal cuts edge strips in polycyclic graphs. These counting polynomials are useful in the topological description of bipartite structures as well as in counting some single number descriptors, i.e. topological indices. These polynomials count equidistant and non-equidistant edges in graphs. In this paper, analytical closed formulas of these polynomials for H-Naphtalenic, TUC4C8(R)[m,n] and TUC4[m,n], nanotubes are derived.

Original languageEnglish
Pages (from-to)1218-1224
Number of pages7
JournalOptoelectronics and Advanced Materials, Rapid Communications
Issue number11-12
Publication statusPublished - 2014
Externally publishedYes


  • Counting polynomial
  • H-Naphtalenic nanotube
  • Nanotube
  • Nanotube
  • Omega polynomial
  • Sadhana polynomial
  • TUCC(R)[m,N] Nanotube
  • TUC[m,N]

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering


Dive into the research topics of 'Computing omega and sadhana polynomials of carbon nanotubes'. Together they form a unique fingerprint.

Cite this