Maximal buttonings of trees
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 ine...
Main Author: | Short Ian |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2014-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1716 |
Similar Items
-
Remarks on Distance Based Topological Indices for <i>ℓ</i>-Apex Trees
by: Martin Knor, et al.
Published: (2020-05-01) -
Peripheral Wiener index of a graph
by: K.P. Narayankar, et al.
Published: (2017-01-01) -
Tree Centroid Properties Clarification
by: Yurii A. Belov, et al.
Published: (2017-08-01) -
On Wiener index of graph complements
by: Jaisankar Senbagamalar, et al.
Published: (2014-06-01) -
Steiner Wiener index of block graphs
by: Matjaž Kovše, et al.
Published: (2020-09-01)