The Open UniversitySkip to content
 

Maximal buttonings of trees

Short, Ian (2014). Maximal buttonings of trees. Discussiones Mathematicae Graph Theory, 34(2) pp. 415–420.

Full text available as:
[img]
Preview
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (239kB) | Preview
URL: http://www.discuss.wmie.uz.zgora.pl/gt/
DOI (Digital Object Identifier) Link: https://doi.org/10.7151/dmgt.1716
Google Scholar: Look up in Google Scholar

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 in trees.

Item Type: Journal Item
Copyright Holders: 2013 The Author
ISSN: 1234-3099
Keywords: centroid; graph metric; tree; walk; Wiener distance
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 35872
Depositing User: Ian Short
Date Deposited: 13 Dec 2012 11:01
Last Modified: 10 Dec 2018 02:32
URI: http://oro.open.ac.uk/id/eprint/35872
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU