"

Cookies ussage consent

I agree.

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

Computing omega and Sadhana polynomials of carbon nanotubes

MUHAMMAD IMRAN1,* , SAKANDER HAYAT1, MUHAMMAD KASHIF SHAFIQ2

Affiliation

  1. Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan
  2. Department of Mathematics, Government College University, Faisalabad, Pakistan

Abstract

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, ( )[ , ] 4 8 TUC C R m n and [ , ] 4 TUC m n nanotubes are derived..

Keywords

Counting polynomial, omega polynomial, Sadhana polynomial, H-Naphtalenic nanotube, ( )[ , ] 4 8 TUC C R m n nanotube, [ , ] 4 TUC m n nanotube.

Citation

MUHAMMAD IMRAN, SAKANDER HAYAT, MUHAMMAD KASHIF SHAFIQ, Computing omega and Sadhana polynomials of carbon nanotubes, Optoelectronics and Advanced Materials - Rapid Communications, 8, 11-12, November-December 2014, pp.1218-1224 (2014).

Submitted at: Sept. 19, 2014

Accepted at: Nov. 13, 2014