Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
The strong vertex span of trees
Authors:
ID
Grašič, Mateja
(
Author
)
ID
Mouron, Christopher
(
Author
)
ID
Taranenko, Andrej
(
Author
)
Files:
RAZ_Grasic_Mateja_2026.pdf
(1,69 MB)
MD5: 2271FDC1F7CC2FA42B02D35B38942A8E
https://doi.org/10.1007/s42967-025-00494-2
Language:
English
Work type:
Scientific work
Typology:
1.01 - Original Scientific Article
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
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.
Keywords:
strong vertex span
,
strong edge span
,
trees
,
algorithm
Publication status:
Published
Publication version:
Version of Record
Submitted for review:
09.12.2024
Article acceptance date:
21.03.2025
Publication date:
03.06.2025
Publisher:
Springer Nature
Year of publishing:
2026
Number of pages:
str. 1157-1170
Numbering:
Letn. 8, št. 3
PID:
20.500.12556/DKUM-93137
UDC:
519.17
ISSN on article:
2096-6385
COBISS.SI-ID:
238697475
DOI:
10.1007/s42967-025-00494-2
Publication date in DKUM:
09.06.2025
Views:
151
Downloads:
19
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Communications on applied mathematics and computation
Shortened title:
Commun. Appl. Math. Comput.
Publisher:
Shanghai University, Springer
ISSN:
2096-6385
COBISS.SI-ID:
114535427
Document is financed by a project
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0288-2022
Name:
Algebra in njena uporaba
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297-2022
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0285-2023
Name:
Metrični problemi v grafih in hipergrafih
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
BI-US/22-24-121-2022
Name:
Razpon in drugi topološki koncepti v teoriji grafov
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:
03.06.2025
Secondary language
Language:
Slovenian
Keywords:
močan razpon oglišč
,
močan razpon robov
,
drevesa
,
algoritem
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
