2017/11/10 by Radek Hušek, Hušek, Radek, Lucie Mohelníková +3 · 1 citation
Computer Science · #Mobile Ad Hoc Networks #Cooperative Communication and Network Coding #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1711.03895
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs -- A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we find that \mathbb Z22-connectivity does not imply \mathbb Z4-connectivity, neither vice versa. We use a computer to find the graphs certifying this and to verify their properties using non-trivial enumerative algorithm. While the graphs are small (the largest has 15 vertices and 21 edges), a computer-free approach remains elusive.