20.500.12556/DKUM-93137 The strong vertex span of trees 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. strong vertex span strong edge span trees algorithm močan razpon oglišč močan razpon robov drevesa algoritem true false true Springer Nature Angleški jezik Slovenski jezik Znanstveno delo 2025-06-09 12:59:31 2025-06-09 13:03:51 2026-05-08 03:09:27 0000-00-00 00:00:00 2026 0 0 str. 1157-1170 št. 3 Letn. 8 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2024-12-09 2025-03-21 2025-06-03 519.17 238697475 10.1007/s42967-025-00494-2 2096-6385 RAZ_Grasic_Mateja_2026.pdf RAZ_Grasic_Mateja_2026.pdf 1 2271FDC1F7CC2FA42B02D35B38942A8E c3db52d29ec124569ce8c0566b20eb6763f8bafbc95c740dcbcee9a16bef4f7f 75c489b7-49ed-11f1-8cc3-00155d0001a1 https://dk.um.si/Dokument.php?lang=slv&id=205881 https://doi.org/10.1007/s42967-025-00494-2 0 5eac8f1f-4521-11f0-8740-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=191966 Fakulteta za naravoslovje in matematiko 0 0 0