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

DOI10.1016/j.dam.2015.09.007zbMath1332.05120OpenAlexW2176747588MaRDI QIDQ260026

Pranava K. Jha

Publication date: 18 March 2016

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

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

zbMATH Keywords

embeddingKronecker productroutinggraphs and networksMöbius laddernetwork topologysix-regular circulantstwisted torus

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)

Related Items

A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER, Efficient eight-regular circulants based on the Kronecker product, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle Kronecker products that are representable as optimal circulants
• On Hamilton cycle decomposition of 6-regular circulant graphs
• The minimal trivalent graphs with given smallest odd cycle
• New dense families of triple loop networks
• On the number of cycles in 3-connected cubic graphs
• A survey on multi-loop networks.
• Higher dimensional hexagonal networks
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• Über eine Eigenschaft der ebenen Komplexe
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Gossiping and routing in undirected triple-loop networks
• Circulants and their connectivities
• Perfect Codes for Metrics Induced by Circulant Graphs
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Minimal diameter double-loop networks. I. Large infinite optimal families
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks
• New Facets of the Linear Ordering Polytope
• PRODUCTS OF CIRCULANT GRAPHS
• On the Möbius Ladders
• A general class of invulnerable graphs
• Hamiltonian decompositions of products of cycles