The strong vertex (edge) span of a given graph G is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of G 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 the 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.
Mateja Grašič
,
Chris Mouron
,
Andrej Taranenko
. The Strong Vertex Span of Trees[J]. Communications on Applied Mathematics and Computation, 2026
, 8(3)
: 1157
-1170
.
DOI: 10.1007/s42967-025-00494-2
[1] Banič, I., Taranenko, A.: Span of a graph: keeping the safety distance. Discrete Math. Theor. Comput. Sci. 25, 1 (2023)
[2] Erceg, G., Šubašić, A., Vojković, T.: Some results on the maximal safety distance in a graph. FILOMAT 37(15), 5123-5136 (2023)
[3] Lelek, A.: Disjoint mappings and the span of spaces. Fund. Math. 55, 199-214 (1964)
[4] Šubašić, A., Vojković, T.: Vertex spans of multilayered cycle and path graphs. Axioms 13, 236 (2024)
[5] Valiente, G.: Algorithms on Trees and Graphs. Springer-Verlag, Berlin, Heidelberg (2002)
