A new counting polynomial, called the »Omega« Ω(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut »qoc« edge strips in a polycyclic graph. Within a qoc, not all cut edges are necessarily orthogonal, meaning not all are pairwise codistant. Two topological indices: CI (Cluj-Ilmenau), eventually equal to the well-known PI index, in planar, bipartite graphs, and IΩ are defined on the newly proposed polynomial and exemplified. Closed analytical formulas for Ω(G, x) and CI in polyhex tori and tubes are given
A method for deriving formulas for evaluating the sum of all distances, known as the Wiener index, o...
The fifth geometric-arithmetic index of a graph $G$ is defined to be GA_5(G). This index was introdu...
The discovery of new nanomaterials adds new dimensions to industry, electronics, and pharmaceutical ...
A new counting polynomial, called the »Omega« Ω(G, x) polynomial, was recently proposed by Diudea on...
Abstract A new counting polynomial, called “Omega ” (G, x), was recently proposed by Diudea. It is d...
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 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 molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edg...
Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to co...
Omega polynomial was defined by M.V. Diudea in 2006 as  where the number of edges co-distant w...
535-537The Sadhana polynomial is defined as Sd(G, x)= Ʃc m(G,c).x |E |⁻c where m(G,c) is the number...
Abstract. Define quasi orthogonal cuts qoc with respect to a given edge in a graph G=G(V,E) as the s...
The PI polynomial of a molecular graph is defined to be the sum X|E(G)|−N(e) + |V(G)|(|V(G)|+1)...
Structural possibilities are considered for what arguably is the most general class of connected “pu...
A method for deriving formulas for evaluating the sum of all distances, known as the Wiener index, o...
The fifth geometric-arithmetic index of a graph $G$ is defined to be GA_5(G). This index was introdu...
The discovery of new nanomaterials adds new dimensions to industry, electronics, and pharmaceutical ...
A new counting polynomial, called the »Omega« Ω(G, x) polynomial, was recently proposed by Diudea on...
Abstract A new counting polynomial, called “Omega ” (G, x), was recently proposed by Diudea. It is d...
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 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 molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edg...
Omega polynomial was proposed by Diudea (Omega Polynomial, Carpath. J. Math., 2006, 22, 43-47) to co...
Omega polynomial was defined by M.V. Diudea in 2006 as  where the number of edges co-distant w...
535-537The Sadhana polynomial is defined as Sd(G, x)= Ʃc m(G,c).x |E |⁻c where m(G,c) is the number...
Abstract. Define quasi orthogonal cuts qoc with respect to a given edge in a graph G=G(V,E) as the s...
The PI polynomial of a molecular graph is defined to be the sum X|E(G)|−N(e) + |V(G)|(|V(G)|+1)...
Structural possibilities are considered for what arguably is the most general class of connected “pu...
A method for deriving formulas for evaluating the sum of all distances, known as the Wiener index, o...
The fifth geometric-arithmetic index of a graph $G$ is defined to be GA_5(G). This index was introdu...
The discovery of new nanomaterials adds new dimensions to industry, electronics, and pharmaceutical ...