Average distances in undirected graphs and the removal of vertices
Journal of Combinatorial Theory Series B
Average distance and independence number
2nd Twente workshop on Graphs and combinatorial optimization
On the sum of all distances in composite graphs
Discrete Mathematics
Hyper- and reverse-Wiener indices of F-sums of graphs
Discrete Applied Mathematics
Note: Wiener and vertex PI indices of Kronecker products of graphs
Discrete Applied Mathematics
Note: The hyper-Wiener index of the generalized hierarchical product of graphs
Discrete Applied Mathematics
Vertex PI indices of four sums of graphs
Discrete Applied Mathematics
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
Discrete Applied Mathematics
Wiener index of some graph operations
Discrete Applied Mathematics
Discrete Applied Mathematics
Hi-index | 0.05 |
The Wiener index is the sum of distances between all vertex pairs in a connected graph. This notion was motivated by various mathematical properties and chemical applications. In this paper we introduce four new operations on graphs and study the Wiener indices of the resulting graphs.