let r be a commutative ring and (r) be its zerodivisor graph. in this article, we studywiener index and energy of γ(zn ) where n = pq or n = p2q and p, q are primes. a matlabcode for our calculations is also presented.

It is well known that the vertices of any graph can be put in a linear preorder so that for random walk on the graph vertices appearing earlier in the preorder are “easier to reach but more difficult to get out of”. We exhibit further such preorders corresponding to various functions related to random walk and study their relationships. These preorders coincide when the graph is a tree, but not...

In this paper, we give solutions for the two conjectures on the inverse problem of the Wiener index of peptoids proposed by Goldman et al. We give the first conjecture a positive proof and the second conjecture a negative answer.

The Wiener index of a connected graph G, denoted by W(G) , is defined as ∑ ( , ) , ∈ ( ) .Similarly, hyper-Wiener index of a connected graph G,denoted by WW(G), is defined as ( ) + ∑ ( , ) , ∈ ( ) .In this paper, we present the explicit formulae for the Wiener, hyper-Wiener and reverse Wiener indices of some graph operations. Using the results obtained here, the exact formulae for Wiener, hyper...

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...

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. Fischermann et al [5] characterized the trees which minimize the Wiener index among all trees with the maximum degree at most ∆. They also determined the trees which maximize the Wiener index, but in a much more restricted family of trees which have two distinct vertex degrees only. In this note, we fully...

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...