scientific article; zbMATH DE number 7656036

DOI10.33048/DAIO.2022.29.743MaRDI QIDQ5878633zbMATH OpenFDO

Authors E. A. Monakhova, O. G. Monakhov

Publication date 21 February 2023

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

zbMATH Keywords

diameternetwork on chipextremal circulant graph of degree sixfamily of circulant networks of degree six

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Series of families of degree six circulant graphs
• On an extremal family of circulant networks
• New families of multiplicative circulant networks
• Multiplicative circulant networks
• Optimization of circulant communication networks of dimension 4

Cites work

• A combinatorial problem related to distributed loop networks
• A survey on multi-loop networks.
• A survey on undirected circulant graphs
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
• Cyclic graphs
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
• Greedy routing in circulant networks
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Series of families of degree six circulant graphs
• Some new optimal and suboptimal infinite families of undirected double-loop networks
• 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 degree-diameter problem for circulant graphs of degrees 10 and 11

Cited in

(2)

• 6-path-connectivity and 6-generation
• Series of families of degree six circulant graphs

This page was built for publication:

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