The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact formulas for computing the vertex-edge Wiener indices of two composite graphs named splice and link.
Azari,M . (2016). A Note on Vertex-Edge Wiener Indices of Graphs. Iranian Journal of Mathematical Chemistry, 7(1), 11-17. doi: 10.22052/ijmc.2016.11865
MLA
Azari,M . "A Note on Vertex-Edge Wiener Indices of Graphs", Iranian Journal of Mathematical Chemistry, 7, 1, 2016, 11-17. doi: 10.22052/ijmc.2016.11865
HARVARD
Azari M. (2016). 'A Note on Vertex-Edge Wiener Indices of Graphs', Iranian Journal of Mathematical Chemistry, 7(1), pp. 11-17. doi: 10.22052/ijmc.2016.11865
CHICAGO
M Azari, "A Note on Vertex-Edge Wiener Indices of Graphs," Iranian Journal of Mathematical Chemistry, 7 1 (2016): 11-17, doi: 10.22052/ijmc.2016.11865
VANCOUVER
Azari M. A Note on Vertex-Edge Wiener Indices of Graphs. Iranian J. Math. Chem.. 2016;7(1):11-17. doi: 10.22052/ijmc.2016.11865
