Network Routing on Regular Directed Graphs from Spanning Factorizations

作者: Randall Dougherty , Vance Faber

DOI: 10.18052/WWW.SCIPRESS.COM/BMSA.20.9

关键词: Graph theoryVertex (geometry)MathematicsCayley graphBipartite graphCosetCombinatoricsDirected graphMultigraphVertex-transitive graph

摘要: Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, universal broadcast, summation) that can be critical when complex algorithms mapped to machines. We showed utilizing the make network optimization tractable problem. particular, Cayley graphs have desirable property certain routing schemes starting from single node transferred all nodes in way does not introduce conflicts. this paper, define concept spanning factorizations and show also used transfer other nodes. many (perhaps all) vertex transitive factorizations. Introduction. papers ([5], [8], [9]), which [9] (and [5]) extend transference idea class is more inclusive than graphs. Notation graph theory. This paper mainly focuses on directed derived groups. Here, G set vertices V collection E ordered pairs distinct ) , ( v u called edges. often let n number m If some pair appears once as an edge, then multigraph. Otherwise form elementary. The 2 tail edge head. Definition (Cayley coset graph). Let Γ finite group, Η subgroup ∆ subset. Suppose (i) ∅ = ∩ us generated by ∪ (ii) ∆Η ⊆ Η∆Η (iii) representatives . Then cosets } : { ∈ g δ When identity subgroup, graph. A graphG if any two there automorphism maps classic proof Sabidussi [13] shows only it An important aspect one construct using group required definition automorphisms fix generators correspond map neighbor.. Spanning 1-factor subgraph both in-degree out-degree equal 1. (Some authors 2factor. Our seems consistent notation undirected For example, edges bi-directional factor union 2-cycles, would ordinary graph.) It known every regular d has 1-factoring 1-factors. completeness, give here. Fact Every where disjoint decomposition into Proof. Form auxiliary B new u′ ′ each bipartite so Hall’s Marriage Theorem, decomposed Each these 1-factors corresponds order create scheme exchange (often transpose – see [10]) consider additional properties.

参考文章(11)
Mária Ždímalová, Ľubica Staneková, Which Faber-Moore-Chen digraphs are Cayley digraphs? Discrete Mathematics. ,vol. 310, pp. 2238- 2240 ,(2010) , 10.1016/J.DISC.2010.04.020
Vance Faber, Transpose on vertex symmetric digraphs. arXiv: Combinatorics. ,(2014)
Vance Faber, Global sum on symmetric networks arXiv: Combinatorics. ,(2012)
Vance Faber, Global communication algorithms for Cayley graphs arXiv: Combinatorics. ,(2013)
F. Comellas, M. Mitjana, Broadcasting in cycle prefix digraphs Discrete Applied Mathematics. ,vol. 83, pp. 31- 39 ,(1998) , 10.1016/S0166-218X(97)00102-9
Gert Sabidussi, Vertex-transitive Graphs. Monatshefte für Mathematik. ,vol. 68, pp. 426- 438 ,(1964) , 10.1007/BF01304186
Brendan D McKay, Mirka Miller, Jozef Širáň, A Note on Large Graphs of Diameter Two and Given Maximum Degree Journal of Combinatorial Theory, Series B. ,vol. 74, pp. 110- 118 ,(1998) , 10.1006/JCTB.1998.1828
Vance Faber, James W. Moore, William Y. C. Chen, Cycle prefix digraphs for symmetric interconnection networks Networks. ,vol. 23, pp. 641- 649 ,(1993) , 10.1002/NET.3230230707
Kenneth O. Kortanek, Maretsugu Yamasaki, Vertex-symmetric digraphs with small diameter Discrete Applied Mathematics. ,vol. 58, pp. 1- 11 ,(1995) , 10.1016/0166-218X(93)E0139-P
Vance Faber, William Y. C. Chen, Bingqing Li, Automorphisms of the cycle prefix digraph arXiv: Combinatorics. ,(2014)