A family of efficient six-regular circulants representable as a Kronecker product

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Discrete Applied Mathematics

• Publication date

  2016-04-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.dam.2015.09.007
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Cycle Kronecker products that are representable as optimal circulants

  2015cited by this paper
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes

  2012influential reference
• Generalized Recursive Circulant Graphs

  2012cited by this paper
• A Survey on Undirected circulant Graphs

  2012cited by this paper
• Twisted Torus Topologies for Enhanced Interconnection Networks

  2010cited by this paper
• Gossiping and routing in undirected triple‐loop networks

  2010cited by this paper
• Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing

  2009cited by this paper
• Perfect Codes for Metrics Induced by Circulant Graphs

  2007cited by this paper
• On Hamilton Cycle Decomposition of 6-regular Circulant Graphs

  2006cited by this paper
• 3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm

  2005cited by this paper
• Higher dimensional hexagonal networks

  2003cited by this paper
• A survey on multi-loop networks

  2003cited by this paper
• New Facets of the Linear Ordering Polytope

  1999cited by this paper
• New dense families of triple loop networks

  1999cited by this paper
• On the Number of Cycles in 3-Connected Cubic Graphs

  1997cited by this paper
• Cayley graphs and interconnection networks

  1997cited by this paper
• Optimal Layouts of Midimew Networks

  1996cited by this paper
• Distributed Loop Computer Networks: A Survey

  1995cited by this paper
• Extremal Problems in the Construction of Distributed Loop Networks

  1994cited by this paper
• Mayfly: A general-purpose, scalable, parallel processing architecture

  1992cited by this paper
• Minimal diameter double-loop networks. I. Large infinite optimal families

  1991cited by this paper
• PRODUCTS OF CIRCULANT GRAPHS

  1990cited by this paper
• Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors

  1990cited by this paper
• The Architecture of the FAIM-1 Symbolic Multiprocessing System

  1985cited by this paper
• The Diameter of undirected graphs associated to plane tessellations

  1985cited by this paper
• The minimal trivalent graphs with given smallest odd cycle

  1985cited by this paper
• Circulants and their connectivities

  1984cited by this paper
• Doubly twisted torus networks for VLSI processor arrays

  1981cited by this paper
• Hamiltonian decompositions of products of cycles

  1978cited by this paper
• A Combinatorial Problem Related to Multimodule Memory Organizations

  1974cited by this paper
• A general class of invulnerable graphs

  1972cited by this paper
• On the Möbius Ladders

  1967cited by this paper
• Über eine Eigenschaft der ebenen Komplexe

  1937cited by this paper
• New dense families of triple loop networks

  year unknowncited by this paper

• Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies

  2021cites this paper
• Efficient eight-regular circulants based on the Kronecker product

  2018cites this paper