Some distance based indices of graphs based on four new operations related to the lexicographic product

For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u, v)(d(u/G)+d(v/G)),$$ respectively, where $d(u/G)$ denotes the degree of a vertex $u$ in $G$ and $d_G(u, v)$ is distance between two vertices $u$ and $v$ of a graph $G$. In this paper, we study Wiener index, hyper-Wiener index and degree distance index of graphs based on four new operations related to the lexicographic product, subdivision and total graph.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.