A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER

DOI10.17223/20710410/49/8zbMath1499.05535OpenAlexW3088169372MaRDI QIDQ5151457

Eh. A. Monakhova

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

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

zbMATH Keywords

circulant graphs of degree 6 with given diameterfamilies of circulant graphsundirected triple loop networks

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A family of efficient six-regular circulants representable as a Kronecker product
• A survey on multi-loop networks.
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Gossiping and routing in undirected triple-loop networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Fault-tolerant routings in chordal ring networks
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
• Undirected loop networks

This page was built for publication: A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER