The relation between different edge spans of a graph

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Šubašić, Aljoša, Vojković, Tanja
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917965251739648
author Šubašić, Aljoša
Vojković, Tanja
author_facet Šubašić, Aljoša
Vojković, Tanja
contents In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the graph, each with different movement conditions. Mainly, vertex spans have been studied, in which players visit all the vertices of a graph. In this paper, we analyze the values of three edge spans, which represent the maximal safety distance that two players can maintain while visiting all the edges of a graph. We present edge span values for some graph classes and examine the relationship between different variants of edge spans.
format Preprint
id arxiv_https___arxiv_org_abs_2306_06714
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The relation between different edge spans of a graph
Šubašić, Aljoša
Vojković, Tanja
Combinatorics
In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the graph, each with different movement conditions. Mainly, vertex spans have been studied, in which players visit all the vertices of a graph. In this paper, we analyze the values of three edge spans, which represent the maximal safety distance that two players can maintain while visiting all the edges of a graph. We present edge span values for some graph classes and examine the relationship between different variants of edge spans.
title The relation between different edge spans of a graph
topic Combinatorics
url https://arxiv.org/abs/2306.06714