×

Wiener index of graphs with more than one cut-vertex. (English) Zbl 1152.05322

Summary: For a simple connected undirected graph \(G\), the Wiener index \(W(G)\) is defined as half the sum of all distances of the form \(d(u,v)\), where the summation is over all possible vertex pairs \(u,v\) in \(G\). Assuming that \(G\) has more than one cut-vertex, we obtain an expression for \(W(G)\) in terms of the Wiener indices of the blocks of \(G\) and other quantities.

MSC:

05C12 Distance in graphs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Balakrishnan, R.; Ranganathan, K., A Textbook of Graph Theory (2000), Springer-Verlag: Springer-Verlag New York · Zbl 0938.05001
[2] Dankelmann, P., Average distance and independence number, Discrete Appl. Math., 51, 75-83 (1994) · Zbl 0803.05020
[3] Dobrynin, A. A.; Entringer, R.; Gutman, I., Wiener index of trees: Theory and applications, Acta Appl. Math., 66, 211-249 (2001) · Zbl 0982.05044
[4] Fischermann, M.; Hoffmann, A.; Rautenbach, D.; Volkmann, L., Wiener index versus maximum degree in trees, Discrete Appl. Math., 122, 127-137 (2002) · Zbl 0993.05061
[5] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064
[6] Jelen, F.; Triesch, E., Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math., 125, 225-233 (2003) · Zbl 1009.05052
[7] Klavžar, S.; Gutman, I., Wiener number of vertex-weighted graphs and a chemical application, Discrete Appl. Math., 80, 73-81 (1997) · Zbl 0889.05046
[8] Winkler, P., Mean distance in a tree, Discrete Appl. Math., 27, 179-185 (1990) · Zbl 0742.05032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.