A new attainable lower bound for the number of nodes in quadruple circulant networks

MaRDI QIDQ5263802zbMATH OpenFDO

Authors E. A. Monakhova

Publication date 17 July 2015

Full work available at URL http://mathnet.ru/eng/da717

zbMATH Keywords

diametermaximum order of a graphundirected circulant network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Optimization of circulant communication networks of dimension 4
• On an extremal family of circulant networks
• Multiplicative circulant networks
• New families of multiplicative circulant networks
• Large circulant graphs of fixed diameter and arbitrary degree

Cited in

(4)

• Multiplicative circulant networks
• Optimization of circulant communication networks of dimension 4
• On an extremal family of circulant networks
• scientific article; zbMATH DE number 7310217 (Why is no real title available?)

This page was built for publication: A new attainable lower bound for the number of nodes in quadruple circulant networks

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