Searching for large multi-loop networks

DOI10.1016/J.ENDM.2014.08.031MaRDI QIDQ283713zbMATH OpenOpenAlexFDO

Authors Ramiro Feria-Purón, Hebert Pérez-Rosés, Joe Ryan

Publication date 13 May 2016

Full work available at URL https://doi.org/10.1016/j.endm.2014.08.031

zbMATH Keywords

network designcirculant graphsdegree/diameter problemDelannoy numbersmulti-loop networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07) Distance in graphs (05C12) Network design and communication in computer systems (68M10)

Recommendations

• New results for the degree/diameter problem
• scientific article; zbMATH DE number 6616702
• Multiplicative circulant networks
• Some new large (Δ, 3)‐graphs
• On an extremal family of circulant networks

Cites work

• scientific article; zbMATH DE number 3845058 (Why is no real title available?)
• scientific article; zbMATH DE number 4201663 (Why is no real title available?)
• scientific article; zbMATH DE number 861410 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A survey on undirected circulant graphs
• Graphs with circulant adjacency matrices
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• Note on a “Square” Functional Equation
• Reliable circulant networks with minimum transmission delay
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• The degree-diameter problem for circulant graphs of degree 8 and 9
• The maximum degree and diameter-bounded subgraph in the mesh

Cited in

(8)

• Series of families of degree six circulant graphs
• The degree/diameter problem for mixed abelian Cayley graphs
• New families of multiplicative circulant networks
• Greedy routing in circulant networks
• A survey on multi-loop networks.
• Search for MC in modified networks
• Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks
• Large circulant graphs of fixed diameter and arbitrary degree

This page was built for publication: Searching for large multi-loop networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283713)