Polynomial interpolation can be used to obtain closed formulas for topological indices of infinite series of molecular graphs. The method is discussed and its advantages and limitations are pointed out. This is illustrated on fullerenes C12k+4 and four topological indices: the Wiener index, the edge Wiener index, the eccentric connectivity index, and the reverse Wiener index. The results for th...

evaluation diversity of agricultural plants and effectiveness of management factors in non-hunting of gharaviz abstract biodiversity is the basis of agriculture. sustainable agriculture both promotes and is enhanced by biodiversity. during present study, agrobiodiversity and management factors were investigated in three villages of gharaviz area and four villages in surroundings area, in sarpol...

We resolve two conjectures of Hri\v{n}\'{a}kov\'{a}, Knor and \v{S}krekovski (2019) concerning the relationship between variable Wiener index Szeged for a connected, non-complete graph, one which would imply other. The strong conjecture is that any such graph there critical exponent in $(0,1]$, below larger above larger. weak always exceeding $1$. They proved bipartite graphs, trees. In this no...

In this paper, the concepts of Wiener index of a vertex weighted and edge weighted graphs are discussed. Vertex weight and edge weight of a clique are introduced. Wiener index of a vertex weighted partial cube is also discussed. Also a new concept known as Connectivity index is introduced. A relation between Connectivity index and Wiener index for different graphs are discussed.

Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...

For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...