the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

Hydrogenated small fullerenes (Cn, n < 60) are of interest as potential astrochemical species, and intermediates in hydrogen-catalysed fullerene growth. However, the computational identification key stable species is difficult due to vast configurationally space structures. In this study, we explored routes predict hydrogenated fullerenes. We showed that neither local geometry nor electronic...

I have computed the matching polynomials of a number isomers fullerenes various sizes with objective developing molecular descriptors and similarity measures for on basis their polynomials. Two novel polynomial-based topological are developed, they demonstrated to discriminating power contrast closely related fullerenes. The ways place up seven disjoint dimers fullerene shown be identical, as n...

Introduction The fullerenes, including C 60 and C 70 , were discovered by Kroto et al. [1] in 1985 during experiments meant to simulate the chemistry of carbon stars. It was initially believed that these molecules would be formed primarily in carbon-rich, hydrogen-poor regions where formation of polyaromatic hydrocarbons (PAHs) would be limited. This hypothesis seemed to be supported by the fir...

A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.