Weighted Szeged Index of Graphs
2018
The weighted Szeged index of a connected graph G is dened as Szw(G) = Σe=uv 2E(G)(dG(u) + dG(v))nGu(e) nGv(e); where nGu (e) is the number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G: In this paper, we have obtained the weighted Szeged index Szw(G) of the splice graph S(G1;G2; y; z) and link graph L(G1;G2; y; z).
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
4
Citations
NaN
KQI