The strong vertex span of trees
Mateja Gra\v{s}i\v{c}, Chris Mouron, Andrej Taranenko

TL;DR
This paper introduces new concepts like switching walks and triod size to determine the strong vertex and edge span of trees, providing a linear-time algorithm for their computation.
Contribution
It defines novel measures for trees and develops an efficient linear-time algorithm to compute the strong vertex and edge span.
Findings
Introduced switching walks and triod size for trees
Derived formulas for strong vertex and edge span
Developed a linear-time algorithm for computation
Abstract
The strong vertex (edge) span of a given graph is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of and moving either to an adjacent vertex or staying in the current position independently of each other. We introduce the notions of switching walks and triod size of a tree, which are used to determine the strong vertex and the strong edge span of an arbitrary tree. The obtained results are used in an algorithm that computes the strong vertex (edge) span of the input tree in linear time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research
