Series of families of degree six circulant graphs

DOI10.17223/20710410/54/6MaRDI QIDQ5068490zbMATH OpenFDO

Authors E. A. Monakhova

Publication date 6 April 2022

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

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) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 7656036
• The degree-diameter problem for circulant graphs of degrees 10 and 11
• On an extremal family of circulant networks
• The degree-diameter problem for circulant graphs of degree 8 and 9
• New families of multiplicative circulant networks

Cites work

• scientific article; zbMATH DE number 4004216 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A family of efficient six-regular circulants representable as a Kronecker product
• A set of families of analytically described triple loop networks defined by a parameter
• A survey on multi-loop networks.
• A survey on undirected circulant graphs
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
• Fault-tolerant routings in chordal ring networks
• Gossiping and routing in undirected triple-loop networks
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Multiplicative circulant networks. Topological properties and communication algorithms
• Network properties of double and triple fixed step graphs
• Searching for large multi-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
• Undirected loop networks

Cited in

(8)

• A class of nearly optimal circulant graphs: \(\{c_p(m,m+1,p/\alpha)\}\)
• A family of efficient six-regular circulants representable as a Kronecker product
• The degree-diameter problem for circulant graphs of degree 8 and 9
• Efficient eight-regular circulants based on the Kronecker product
• The degree-diameter problem for circulant graphs of degrees 10 and 11
• scientific article; zbMATH DE number 7656036 (Why is no real title available?)
• On an extremal family of circulant networks
• scientific article; zbMATH DE number 1549865 (Why is no real title available?)

This page was built for publication: Series of families of degree six circulant graphs

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