Span capacities of graphs
组合数学
2026-05-19 v1
摘要
The -capacity of a graph is introduced as the maximum number of players that can simultaneously traverse such that each player visits all vertices while maintaining a distance of at least under various movement rules. We determine their values for paths and cycles and provide bounds for bipartite graphs. Furthermore, we characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity.
引用
@article{arxiv.2605.16852,
title = {Span capacities of graphs},
author = {Mateja Grašič and Christopher Mouron and Aljoša Šubašić and Andrej Taranenko and Tanja Vojković},
journal= {arXiv preprint arXiv:2605.16852},
year = {2026}
}