All-to-all Routing on Digraph Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914047546359808 |
|---|---|
| author | Chishwashwa, Nyumbu Faber, Vance Streib, Noah |
| author_facet | Chishwashwa, Nyumbu Faber, Vance Streib, Noah |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_10537 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | All-to-all Routing on Digraph Networks Chishwashwa, Nyumbu Faber, Vance Streib, Noah Combinatorics Networking and Internet Architecture 05C90 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. |
| title | All-to-all Routing on Digraph Networks |
| topic | Combinatorics Networking and Internet Architecture 05C90 |
| url | https://arxiv.org/abs/2208.10537 |