Wiener Index of k-Connected Graphs
Keyword(s):
The Wiener index [Formula: see text] of a connected graph [Formula: see text] is the sum of distances of all pairs of vertices in [Formula: see text]. In this paper, we show that for any even positive integer [Formula: see text], and [Formula: see text], if [Formula: see text] is a [Formula: see text]-connected graph of order [Formula: see text], then [Formula: see text], where [Formula: see text] is the [Formula: see text]th power of a graph [Formula: see text]. This partially answers an old problem of Gutman and Zhang.
Keyword(s):
2018 ◽
Vol 12
(2)
◽
pp. 297-317
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050071
Keyword(s):
2018 ◽
Vol 34
◽
pp. 459-471
◽
Keyword(s):
2020 ◽
Vol 13
(5)
◽
pp. 1231-1240
Keyword(s):
2020 ◽
Vol 12
(03)
◽
pp. 2050038
Keyword(s):