Optimization of circulant communication networks of dimension 4

MaRDI QIDQ3115690zbMATH OpenFDO

Authors E. A. Monakhova

Publication date 10 February 2012

zbMATH Keywords

circulant networkmaximum order of a graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On an extremal family of circulant networks
• Multiplicative circulant networks
• A new attainable lower bound for the number of nodes in quadruple circulant networks
• New families of multiplicative circulant networks
• Reliable circulant networks with minimum transmission delay

Cited in

(9)

• Polyhedral structure of the 4-node network design problem
• Multiplicative circulant networks
• A new attainable lower bound for the number of nodes in quadruple circulant networks
• The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter
• On an extremal family of circulant networks
• scientific article; zbMATH DE number 7656036 (Why is no real title available?)
• A lower bound for the average number of hops in communication networks with circulant topologies of arbitrary degree
• scientific article; zbMATH DE number 7310217 (Why is no real title available?)
• New families of multiplicative circulant networks

This page was built for publication: Optimization of circulant communication networks of dimension 4

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