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

N. Dehgardi, M. S. Sheikholeslami, M. Soroudi

Abstract


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 fournew operations related to the lexicographic product, subdivision and total graph.

Keywords


Wiener index, degree distance index, hyper-Wiener index, lexicographic product, subdivision, total graph

Full Text: Article
3 :: 11

Refbacks

  • There are currently no refbacks.


Creative Commons License
The journal is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported.