On connectivity of consecutive-\(d\) digraphs (Q1850019): Difference between revisions

The authors continue the study of consecutive-\(d\) digraphs \(G(d,n,q,r)\), where \(d\), \(n\), \(q\), \(r\) are integers satisfying \(0< d\leq n\), \(-n/2< q\leq n/2\) and \(q\neq 0\). They give strong results concerning the connectivity of these graphs and study the problem of finding good candidates for the topological structure of communication networks.