Maximal buttonings of trees

Ian Short

Discussiones Mathematicae Graph Theory (2014)

  • Volume: 34, Issue: 2, page 415-420
  • ISSN: 2083-5892

Abstract

top
A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees

How to cite

top

Ian Short. "Maximal buttonings of trees." Discussiones Mathematicae Graph Theory 34.2 (2014): 415-420. <http://eudml.org/doc/267690>.

@article{IanShort2014,
abstract = {A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees},
author = {Ian Short},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {centroid; graph metric; tree; walk; Wiener distance},
language = {eng},
number = {2},
pages = {415-420},
title = {Maximal buttonings of trees},
url = {http://eudml.org/doc/267690},
volume = {34},
year = {2014},
}

TY - JOUR
AU - Ian Short
TI - Maximal buttonings of trees
JO - Discussiones Mathematicae Graph Theory
PY - 2014
VL - 34
IS - 2
SP - 415
EP - 420
AB - A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees
LA - eng
KW - centroid; graph metric; tree; walk; Wiener distance
UR - http://eudml.org/doc/267690
ER -

References

top
  1. [1] C.A. Barefoot, R.C. Entringer and L.A. Sz´ekely, Extremal values for ratios of dis- tances in trees, Discrete Appl. Math. 80 (1997) 37-56. doi:10.1016/S0166-218X(97)00068-1[Crossref] 
  2. [2] A.A. Dobrynin, R. Entringer and I. Gutman, Wiener index of trees: theory and applications, Acta Appl. Math 66 (2001) 211-249. doi:10.1023/A:1010767517079[Crossref] Zbl0982.05044
  3. [3] L. Johns and T.C. Lee, S-distance in trees, in: Computing in the 90’s (Kalamazoo, MI, 1989), Lecture Notes in Comput. Sci., 507, N.A. Sherwani, E. de Doncker and J.A. Kapenga (Ed(s)), (Springer, Berlin, 1991) 29-33. doi:10.1007/BFb0038469[Crossref] 
  4. [4] T. Lengyel, Some graph problems and the realizability of metrics by graphs, Congr. Numer. 78 (1990) 245-254. Zbl0862.05038

NotesEmbed ?

top

You must be logged in to post comments.