AbstractThe PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e|G) over all the edges e=uv of a connected graph G, i.e., PI(G)=∑e∈E(G)[neu(e|G)+nev(e|G)], where neu(e|G) is the number of edges of G lying closer to u than to v and nev(e|G) is the number of edges of G lying closer to v than to u. An efficient formula for calculating the PI index of polyomino chains is given, and the bounds for the PI index of polyomino chains are established
This paper is dedicated to Professor Ivan Gutman, teacher, inspirer, friend, and proprietor of graph...
Let G=(V,E) be a graph and e=uv∈E. Define nu(e,G) be the number of vertices of G closer to u than to...
Department of Mathematics, Statistics and Computer Science, Faculty of Science, University of Kashan...
AbstractThe PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e...
The Padmakar–Ivan (PI) index is a graph invariant defined as the summation of the sums of n eu (e|G)...
AbstractFor a molecular graph, the first Zagreb index M1 is equal to the sum of squares of the verte...
The Padmakar–Ivan (PI) index of a graph G is defined as PI(G) = ∑[n eu (e|G)+ n ev (e|G)], where n ...
PI index is an edge-additive topological index introduced as a counterpart to the vertex-multiplicat...
AbstractRecently the vertex Padmakar–Ivan (PIv) index of a graph G was introduced as the sum over al...
AbstractThe Padmakar–Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of...
The Padmakar-Ivan (PI) index of a graph G is defined as PI (G) = Σ [neu(e|G)+nev(e|G)], where for ed...
Let G=(V,E) be a graph. The atom-bond connectivity (ABC) index is defined as the sum of weights ((du...
AbstractThe Padmakar–Ivan index of a graph G is the sum over all edges uv of G of number of edges wh...
Omega polynomial was defined by M.V. Diudea in 2006 as  where the number of edges co-distant w...
AbstractSuppose that e is an edge of a graph G. Denote by me(G) the number of vertices of G that are...
This paper is dedicated to Professor Ivan Gutman, teacher, inspirer, friend, and proprietor of graph...
Let G=(V,E) be a graph and e=uv∈E. Define nu(e,G) be the number of vertices of G closer to u than to...
Department of Mathematics, Statistics and Computer Science, Faculty of Science, University of Kashan...
AbstractThe PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e...
The Padmakar–Ivan (PI) index is a graph invariant defined as the summation of the sums of n eu (e|G)...
AbstractFor a molecular graph, the first Zagreb index M1 is equal to the sum of squares of the verte...
The Padmakar–Ivan (PI) index of a graph G is defined as PI(G) = ∑[n eu (e|G)+ n ev (e|G)], where n ...
PI index is an edge-additive topological index introduced as a counterpart to the vertex-multiplicat...
AbstractRecently the vertex Padmakar–Ivan (PIv) index of a graph G was introduced as the sum over al...
AbstractThe Padmakar–Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of...
The Padmakar-Ivan (PI) index of a graph G is defined as PI (G) = Σ [neu(e|G)+nev(e|G)], where for ed...
Let G=(V,E) be a graph. The atom-bond connectivity (ABC) index is defined as the sum of weights ((du...
AbstractThe Padmakar–Ivan index of a graph G is the sum over all edges uv of G of number of edges wh...
Omega polynomial was defined by M.V. Diudea in 2006 as  where the number of edges co-distant w...
AbstractSuppose that e is an edge of a graph G. Denote by me(G) the number of vertices of G that are...
This paper is dedicated to Professor Ivan Gutman, teacher, inspirer, friend, and proprietor of graph...
Let G=(V,E) be a graph and e=uv∈E. Define nu(e,G) be the number of vertices of G closer to u than to...
Department of Mathematics, Statistics and Computer Science, Faculty of Science, University of Kashan...