Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x ) = ( , ). , c c m G c x  where m(G,c) be the number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al ...

Jacquelyn J. Chini, Adrian Madsen, Elizabeth Gire, N. Sanjay Rebello, and Sadhana Puntambekar Department of Physics, University of Central Florida, 4000 Central Florida Boulevard, Orlando, Florida, 32816-2385, USA Department of Physics, 116 Cardwell Hall, Kansas State University, Manhattan, Kansas 66506-2601, USA Department of Physics, 216 Manning Hall, University of Memphis, Memphis, Tennessee...

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms 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 infinite class of fullerenes is constructed. ...

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 ...