The Omega polynomial of a connected graph G, denoted by Ω(G,x), is defined as, and the Sadhana polynomial of G is defined as, where m(G, c) is the number of strips of length c and |E(G)| is the number of edges in G. In this paper, the Omega and Sadhana polynomials are computed...
