Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological in...Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological index is . In this paper, the Schultz, Modified Schultz polynomials and their topological indices of Jahangir graphs J<sub>2,m</sub> for all integer number m ≥ 3 are calculated.展开更多
In this paper, we compute Atom-bond connectivity index, Fourth atom-bond connectivity index, Sum connectivity index, Randic connectivity index, Geometric-arithmetic connectivity index and Fifth geometric-arithmetic co...In this paper, we compute Atom-bond connectivity index, Fourth atom-bond connectivity index, Sum connectivity index, Randic connectivity index, Geometric-arithmetic connectivity index and Fifth geometric-arithmetic connectivity index of Dutch windmill graph.展开更多
A topological index is a numerical value associated with chemical constitution for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. In this paper, we comp...A topological index is a numerical value associated with chemical constitution for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. In this paper, we computed the Omega and Cluj-Ilumenau indices of a very famous hydrocarbon named as Polycyclic Aromatic Hydrocarbons PAH<sub>k</sub> for all integer number k.展开更多
Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This p...Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.展开更多
In theoretical chemistry, the researchers use graph models to express the structure of molecular, and the Zagreb indices and multiplicative Zagreb indices defined on molecular graph G are applied to measure the chemic...In theoretical chemistry, the researchers use graph models to express the structure of molecular, and the Zagreb indices and multiplicative Zagreb indices defined on molecular graph G are applied to measure the chemical characteristics of compounds and drugs. In this paper, we present the exact expressions of multiplicative Zagreb indices for certain important chemical structures like nanotube, nanostar and polyomino chain.展开更多
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, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</...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, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</sub>(G,x) and Zg<sub>1</sub>(G) of the graph G are defined as Σ<sub>uv∈E(G)</sub>x<sup>(d<sub>u</sub>+d<sub>v</sub>)</sup> and Σ<sub>e=uv∈E(G)</sub>(d<sub>u</sub>+d<sub>v</sub>) respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as Zg<sub>1</sub>*</sup>=Σ<sub>uv∈E(G)</sub>(ecc(v)+ecc(u)), that ecc(u) is the largest distance between u and any other vertex v of G. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.展开更多
文摘Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological index is . In this paper, the Schultz, Modified Schultz polynomials and their topological indices of Jahangir graphs J<sub>2,m</sub> for all integer number m ≥ 3 are calculated.
文摘In this paper, we compute Atom-bond connectivity index, Fourth atom-bond connectivity index, Sum connectivity index, Randic connectivity index, Geometric-arithmetic connectivity index and Fifth geometric-arithmetic connectivity index of Dutch windmill graph.
文摘A topological index is a numerical value associated with chemical constitution for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. In this paper, we computed the Omega and Cluj-Ilumenau indices of a very famous hydrocarbon named as Polycyclic Aromatic Hydrocarbons PAH<sub>k</sub> for all integer number k.
文摘Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.
文摘In theoretical chemistry, the researchers use graph models to express the structure of molecular, and the Zagreb indices and multiplicative Zagreb indices defined on molecular graph G are applied to measure the chemical characteristics of compounds and drugs. In this paper, we present the exact expressions of multiplicative Zagreb indices for certain important chemical structures like nanotube, nanostar and polyomino chain.
文摘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, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</sub>(G,x) and Zg<sub>1</sub>(G) of the graph G are defined as Σ<sub>uv∈E(G)</sub>x<sup>(d<sub>u</sub>+d<sub>v</sub>)</sup> and Σ<sub>e=uv∈E(G)</sub>(d<sub>u</sub>+d<sub>v</sub>) respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as Zg<sub>1</sub>*</sup>=Σ<sub>uv∈E(G)</sub>(ecc(v)+ecc(u)), that ecc(u) is the largest distance between u and any other vertex v of G. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.
