Superdominance order and distance of trees with bounded maximum degree

Discrete Applied Mathematics

Volumn 125, Issue 2-3, 2003, Pages 225-233

  Jelen, F ^a   Triesch, E ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Distance; Dominance order; Tree; Wiener index

Indexed keywords

EID: 84867971430     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00195-6     Document Type: Article

References (9)

1. F. Buckley, and F. Harary Distance in Graphs 1990 Addison-Wesley Redwood
2. R.C. Entringer Distance in graphs trees J. Combin. Math. Combin. Comput. 24 1997 65 84
3. R.C. Entringer, D.E. Jackson, and D.A. Snyder Distance in graphs Czechoslovak Math. J. 26 101 1976 283 296
4. M. Fischermann, A. Hoffmann, D. Rautenbach, L.A. Székely, L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl. Math., 120 (2002) 95-105.
5. F. Jelen, Superdominance order and distance of trees, Doctoral Thesis, RWTH Aachen, Germany.
6. L. Lovász Combinatorial Problems and Exercises 2nd Edition 1993 North-Holland Amsterdam
7. A.W. Marshall, and I. Olkin Inequalities: Theory of Majorization and Its Applications Mathematics in Science and Engineering Vol. 143 1979 Academic Press New York
8. J. Plesnk On the sum of all distances in a graph or digraph J. Graph Theory 8 1984 1 21
9. H. Wiener Structural determination of paraffin boiling points J. Amer. Chem. Soc. 69 1947 17 20