scientific article; zbMATH DE number 7310217

MaRDI QIDQ5150591

Eh. A. Monakhova

Publication date: 15 February 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

diametermaximum order of graphundirected circulant graphs

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items (1)

The degree-diameter problem for circulant graphs of degrees 10 and 11

Cites Work

• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• Multiplicative circulant networks. Topological properties and communication algorithms
• A survey on multi-loop networks.
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Triple Loop Networks with Minimal Transmission Delay
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• Undirected loop networks
• All-to-all optical routing in chordal rings of degree 4
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: