Wiener index of graphs with more than one cut-vertex

Applied Mathematics Letters

Volumn 21, Issue 9, 2008, Pages 922-927

  Balakrishnan, R ^a   Sridharan, N ^b   Viswanathan Iyer, K ^c  

^a SASTRA UNIVERSITY   (India)

^b ALAGAPPA UNIVERSITY   (India)

^c NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Average distance; Block; Cut vertex; Distance in graphs; Wiener index

Indexed keywords

CUT VERTEX; OF GRAPHS; UNDIRECTED GRAPHS; VERTEX PAIRS; WIENER INDICES;

GRAPH THEORY;

EID: 47049108090     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2007.10.003     Document Type: Article

References (8)

1. Balakrishnan R., and Ranganathan K. A Textbook of Graph Theory (2000), Springer-Verlag, New York
2. Dankelmann P. Average distance and independence number. Discrete Appl. Math. 51 (1994) 75-83
3. Dobrynin A.A., Entringer R., and Gutman I. Wiener index of trees: Theory and applications. Acta Appl. Math. 66 (2001) 211-249
4. Fischermann M., Hoffmann A., Rautenbach D., and Volkmann L. Wiener index versus maximum degree in trees. Discrete Appl. Math. 122 (2002) 127-137
5. Harary F. Graph Theory (1969), Addison-Wesley, Reading, MA
6. Jelen F., and Triesch E. Superdominance order and distance of trees with bounded maximum degree. Discrete Appl. Math. 125 (2003) 225-233
7. Klavžar S., and Gutman I. Wiener number of vertex-weighted graphs and a chemical application. Discrete Appl. Math. 80 (1997) 73-81
8. Winkler P. Mean distance in a tree. Discrete Appl. Math. 27 (1990) 179-185