Reliable circulant networks with minimum transmission delay

DOI10.1109/TCS.1985.1085667zbMath0583.94018MaRDI QIDQ3708710

Francis T. Boesch, Jhing-Fa Wang

Publication date: 1985

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

zbMATH Keywords

symmetric graphsdesign of reliable networksmaximum connectivity graphsminimum diameter, maximum connectivity circulant problem

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items

A survey on multi-loop networks., Mathematical properties of the hyperbolicity of circulant networks, The hyperbolicity constant of infinite circulant graphs, Greedy routing in circulant networks, Searching for large multi-loop networks, Connectivities of random circulant digraphs, Finding shortest paths in distributed loop networks, Deterministic small-world communication networks, On the metric dimension of circulant and Harary graphs, A SURVEY ON UNDIRECTED CIRCULANT GRAPHS, Dense bipartite circulants and their routing via rectangular twisted torus, Dense Gaussian networks: Suitable topologies for on-chip multiprocessors, Searching for (near) Optimal Codes, Multiplicative circulant networks. Topological properties and communication algorithms, INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH, FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR, Large fault-tolerant interconnection networks, The degree/diameter problem for mixed abelian Cayley graphs, On arc-transitive circulant digraphs, Fault-tolerant routings in double fixed-step networks, Embedding Circulant Networks into Butterfly and Benes Networks, Tight-optimal circulants vis-à-vis twisted tori, On the partition dimension of a class of circulant graphs, Cycle Kronecker products that are representable as optimal circulants, Improved Bound for Dilation of an Embedding onto Circulant Networks, Bothway embedding of circulant network into grid, Distributed loop network with minimum transmission delay, A Moore-like bound for mixed abelian Cayley graphs, Efficient eight-regular circulants based on the Kronecker product, Isomorphisms of circulant digraphs, Co-evolving architectures for cellular machines, Unnamed Item, Unnamed Item