Series of families of degree six circulant graphs

DOI10.17223/20710410/54/6zbMATH Open1486.05261MaRDI QIDQ5068490FDOQ5068490

Authors: E. A. Monakhova 

Publication date: 6 April 2022

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

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

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)

Cites Work

• A survey on multi-loop networks.
• A family of efficient six-regular circulants representable as a Kronecker product
• A survey on undirected circulant graphs
• Gossiping and routing in undirected triple-loop networks
• Title not available (Why is that?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Moore graphs and beyond: a survey of the degree/diameter problem
• 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
• Multiplicative circulant networks. Topological properties and communication algorithms
• Undirected loop networks
• 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
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Fault-tolerant routings in chordal ring networks
• Network properties of double and triple fixed step graphs
• 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

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
• Title not available (Why is that?)
• On an extremal family of circulant networks
• Title not available (Why is that?)

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)