Graphs with span 1 and shortest optimal walks

Tanja Dravec, Mirjana Mikalački and Andrej Taranenko

Applied Mathematics and Computation, 2025, vol. 500, issue C

Abstract: A span of a given graph G is the maximum distance that two players can keep at all times while visiting all vertices (edges) of G and moving according to certain rules, that produces different variants of span. We prove that the vertex and edge span of the same variant can differ by at most 1 and present a graph where the difference is exactly 1. For all variants of vertex span we present a lower bound in terms of the girth of the graph. Then we study graphs with the strong vertex span equal to 1. We present some nice properties of such graphs and show that interval graphs are contained in the class of graphs having the strong vertex span equal to 1. Finally, we present an algorithm that returns the minimum number of moves needed for both players to traverse all vertices of the given graph G such that in each move the distance between players equals at least the chosen vertex span of G.

Keywords: Span of graphs; Strong vertex span; Safety distance; Shortest walk (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325001602
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001602

DOI: 10.1016/j.amc.2025.129433

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().