scientific article; zbMATH DE number 7656036
From MaRDI portal
Publication:5878633
DOI10.33048/DAIO.2022.29.743MaRDI QIDQ5878633FDOQ5878633
Authors: E. A. Monakhova, O. G. Monakhov
Publication date: 21 February 2023
Full work available at URL: http://mathnet.ru/eng/da1309
Title of this publication is not available (Why is that?)
Recommendations
diameternetwork on chipextremal circulant graph of degree sixfamily of circulant networks of degree six
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- A survey on multi-loop networks.
- A survey on undirected circulant graphs
- Minimal diameter double-loop networks. I. Large infinite optimal families
- 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
- A combinatorial problem related to distributed loop networks
- Cyclic graphs
- An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
- The degree-diameter problem for circulant graphs of degrees 10 and 11
- Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
- Greedy routing in circulant networks
- Some new optimal and suboptimal infinite families of undirected double-loop networks
- Series of families of degree six circulant graphs
Cited In (2)
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)