On reversing arcs to improve arc-connectivity
Combinatorics
2023-05-03 v1 Discrete Mathematics
Abstract
We show that if the arc-connectivity of a directed graph is at most and the reorientation of an arc set in results in a -arc-connected directed graph then we can reorient one arc of without decreasing the arc-connectivity of This improves a result of Fukuda, Prodon, Sakuma and one of Ito et al. for .
Keywords
Cite
@article{arxiv.2305.01444,
title = {On reversing arcs to improve arc-connectivity},
author = {Pierre Hoppenot and Zoltán Szigeti},
journal= {arXiv preprint arXiv:2305.01444},
year = {2023}
}
Comments
8 pages