Indian Journal of Chemistry Vol. 47A, April 2008, pp. 535-537 Notes Computing Sadhana polynomial of V-phenylenic nanotubes and nanotori A R Ashrafi*, M Ghorbani & M Jalali Institute of Nanoscience and Nanotechnology, University of Kashan, Kashan 87317-51167, I. R. Iran Email: ashrafi@kashanu.ac.ir Received 23 February 2007; revised 24 March 2008 The Sadhana polynomial is defined as |E| c c Sd(G,x) m(G,c) x , - = ⋅ where m(G, c) is the number of strips of length c. This new polynomial has been defined to evaluate the Sadhana index of a molecular graph. The relation between this new polynomial and Omega polynomial is investigated. In particular, a method of computing Sadhana polynomial and then Sadhana index for V-phenylenic nanotubes and nanotori with given parameters m and n has been described. The unique properties of carbon nanotubes have made this new form of solid carbon the most studied nano- material for the past few years. 1,2 They are among the stiffest and strongest fibres known, and have remarkable electronic properties and many other unique characteristics. For these reasons they have attracted tremendous academic and industrial interest. It is, thus, of interest to study the mathematical properties of these materials. In recent years, several papers have been published on the mathematical properties of nanotubes. Some authors computed the Wiener, Szeged, Balaban, Schultz and PI indices of nanotubes and nanotori while others have studied their kekulé structures. 3-13 Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. Chemical graph theory is an important tool for studying molecular structures. 14-16 This theory had an important effect on the development of the chemical sciences. In the present Note, an attempt has been made for studying nanostructures by using graph theory. Methodology In this section, we recall some algebraic definitions that will be used in the paper. Let G be a simple molecular graph without directed and multiple edges and without loops, the vertex and edge-sets of which are represented by V(G) and E(G), respectively. Suppose G is a connected molecular graph and x, y ∈ V(G). The distance d(x,y) between x and y is defined as the length of a minimum path between x and y. Two edges e = ab and f = xy of G are called codistant, “e co f”, if and only if d(a,x) = d(b,y) = k and d(a,y) = d(b,x) = k+1 or vice versa, for a non-negative integer k. It is easy to see that the relation “co” is reflexive and symmetric but it is not necessary to be transitive. Set C(e):= {f ∈ E(G) | f co e}. If the relation “co” is transitive on C(e) then C(e) is called an orthogonal cut “oc” of the graph G. The graph G is called co-graph if and only if the edge set E(G) is the union of disjoint orthogonal cuts. The Omega polynomial Ω(G,x) for counting qoc strips in G was defined by Diudea as Ω (G, x) = Σ c m(G, c) × x c , with m(G,c) being the number of strips of length c. The summation runs up to the maximum length of qoc strips in G. If G is bipartite, then a qoc starts and ends out of G and so Ω(G, 1) = r /2, in which r is the number of edges in out of G (refs 17-20). The Sadhana index Sd(G) for counting qoc strips in G was defined by Khadikar et al. 21,22 as Sd(G)= Σ c m(G,c)(|E(G)|-c), where m(G,c) is the number of strips of length c. We now define the Sadhana polynomial of a graph G as Sd(G,x)=Σ c m(G,c) x |E|-c ) By definition of Omega polynomial, one can obtain the Sadhana polynomial by replacing x c with x |E|-c in Omega polynomial. Then the Sadhana index will be the first derivative of Sd(G, x) evaluated at x = 1. The aim of this study is to compute the Sadhana polynomial and then Sadhana index of V-phenylenic nanotubes and nanotori. To do this, we first draw these compounds by HeperChem 23 and then compute their adjacency and distance matrices by TopoCluj 24 . Next, we apply some GAP 25,26 programs to compute the number of parallel edges for a given edge of these nanomaterials. Final step of this process is analyzing data obtained by our GAP programs. These programs are accessible from the authors upon request. Herein, our notation is standard and taken from the standard book of graph theory and related studies 27-31 . Results and discussion The Sadhana polynomial of a V-phenylenic nanotube and nanotorus were computed as described