Efficient eight-regular circulants based on the Kronecker product

DOI10.1016/j.dam.2018.02.006zbMath1387.05218OpenAlexW2792431525MaRDI QIDQ1752463

Pranava K. Jha

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.006

zbMATH Keywords

isometric embeddingKronecker productgraphs and networksnetwork topologydense four-regular circulanteight-regular circulants

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A family of efficient six-regular circulants representable as a Kronecker product
• Cycle Kronecker products that are representable as optimal circulants
• The degree-diameter problem for circulant graphs of degree 8 and 9
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
• Hamiltonian decomposition of Cayley graphs of degree 4
• A survey on multi-loop networks.
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Reliable circulant networks with minimum transmission delay
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Extremal Problems in the Construction of Distributed Loop Networks
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• PRODUCTS OF CIRCULANT GRAPHS
• Hamiltonian decompositions of products of cycles

This page was built for publication: Efficient eight-regular circulants based on the Kronecker product