نتایج جستجو برای: sadhana polynomial
تعداد نتایج: 97672 فیلتر نتایج به سال:
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.
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) euv 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 ...
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 v u v e uv PI (G) n (e) n (e). = = + ∑ Then Omega polynomial Ω(G,x) for counting qoc strips in G is defined as Ω(G,x) = ∑cm(G,c)x with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is construc...
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) euv 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. ...
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 ...
Sudhanshu Dixit Sadhana Singh
It has been exciting, however, to discover that this topic strongly brings together my personal meditation practice and my professional interests. When I initially chose this topic, I wanted to reflect on my acquaintance with the practice of the sadhana of Vajrayogini, which I have been doing for the past three years. Traditionally, it is said that this practice, which is somewhat advanced, inv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید