scientific article; zbMATH DE number 7504249

DOI10.17223/20710410/54/6zbMath1486.05261MaRDI QIDQ5068490

Eh. A. Monakhova

Publication date: 6 April 2022

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

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

zbMATH Keywords

degree/diameter problemabelian Cayley graphextremal circulant graphsfamilies of degree six circulant graphstriple loop graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• A family of efficient six-regular circulants representable as a Kronecker product
• Searching for large multi-loop networks
• The degree-diameter problem for circulant graphs of degree 8 and 9
• The degree-diameter problem for circulant graphs of degrees 10 and 11
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Multiplicative circulant networks. Topological properties and communication algorithms
• A survey on multi-loop networks.
• Moore graphs and beyond: a survey of the degree/diameter problem
• 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
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
• Undirected loop networks

This page was built for publication: