All-to-all Routing on Digraph Networks
Combinatorics
2025-09-23 v3 Networking and Internet Architecture
Abstract
We discuss an open problem and its converse first posed by Dougherty and Faber in [3], "Network routing on regular directed graphs from spanning factorizations." Does every vertex transitive digraph have a spanning 1=factorization? We show relationships between various properties a regular digraph might have: vertex transitivity, left or right cancellation, tree-like or neighborhood preserving spanning factorizations.
Keywords
Cite
@article{arxiv.2208.10537,
title = {All-to-all Routing on Digraph Networks},
author = {Nyumbu Chishwashwa and Vance Faber and Noah Streib},
journal= {arXiv preprint arXiv:2208.10537},
year = {2025}
}
Comments
7 pages