Omega polynomial was defined by M.V. Diudea in 2006 as  where the number of edges co-distant with e is denoted by n(e). One can obtain Theta Θ, Sadhana Sd and Pi Πpolynomials by replacing xn(e) with n(e)xn(e), x|E|-n(e) and n(e)x|E|-n(e) in Omega polynomial, respectively. Then Theta Θ, Sadhana Sd and Pi Πindices will be the first derivative of Θ(x), Sd(x) and Π(x) evaluated at x=1. In this paper, Pi Π(G,x) polynomial and Pi Π(G) index of an infinite family of linear polycene parallelogram benzenoid graph P(a,b) are computed for the first time
535-537The Sadhana polynomial is defined as Sd(G, x)= Ʃc m(G,c).x |E |⁻c where m(G,c) is the number...
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include...
Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to co...
Let G=(V,E) be a molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edg...
Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without lo...
A new counting polynomial, called the »Omega« Ω(G, x) polynomial, was recently proposed by Diudea on...
Counting polynomials are important graph invariants whose coefficients and exponents are related to ...
Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. We de...
The Padmakar–Ivan (PI) index of a graph G is defined as PI(G) = ∑[n eu (e|G)+ n ev (e|G)], where n ...
The Padmakar-Ivan (PI) index of a graph G is defined as PI (G) = Σ [neu(e|G)+nev(e|G)], where for ed...
Counting polynomials are mathematical functions having as coefficients the multiplicity of property ...
AbstractThe PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e...
A new graphene pattern, called CorSu, was designed by combining the patterns of coronene [6:66] and ...
This paper is dedicated to Professor Milan Randi} on the occasion of his 80th birthday Omega polynom...
Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. We de...
535-537The Sadhana polynomial is defined as Sd(G, x)= Ʃc m(G,c).x |E |⁻c where m(G,c) is the number...
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include...
Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to co...
Let G=(V,E) be a molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edg...
Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without lo...
A new counting polynomial, called the »Omega« Ω(G, x) polynomial, was recently proposed by Diudea on...
Counting polynomials are important graph invariants whose coefficients and exponents are related to ...
Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. We de...
The Padmakar–Ivan (PI) index of a graph G is defined as PI(G) = ∑[n eu (e|G)+ n ev (e|G)], where n ...
The Padmakar-Ivan (PI) index of a graph G is defined as PI (G) = Σ [neu(e|G)+nev(e|G)], where for ed...
Counting polynomials are mathematical functions having as coefficients the multiplicity of property ...
AbstractThe PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e...
A new graphene pattern, called CorSu, was designed by combining the patterns of coronene [6:66] and ...
This paper is dedicated to Professor Milan Randi} on the occasion of his 80th birthday Omega polynom...
Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. We de...
535-537The Sadhana polynomial is defined as Sd(G, x)= Ʃc m(G,c).x |E |⁻c where m(G,c) is the number...
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include...
Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to co...