Searching for large multi-loop networks

DOI10.1016/j.endm.2014.08.031zbMath1338.05252OpenAlexW2057695235MaRDI QIDQ283713

Ramiro Feria-Purón, Hebert Pérez-Rosés, Joseph F. Ryan

Publication date: 13 May 2016

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

zbMATH Keywords

multi-loop networksnetwork designcirculant graphsdegree/diameter problemDelannoy numbers

Mathematics Subject Classification ID

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

Related Items (6)

Greedy routing in circulant networks ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ 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 ⋮ NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum degree and diameter-bounded subgraph in the mesh
• The degree-diameter problem for circulant graphs of degree 8 and 9
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• Reliable circulant networks with minimum transmission delay
• A Combinatorial Problem Related to Multimodule Memory Organizations
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Note on a “Square” Functional Equation
• Graphs with circulant adjacency matrices

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