Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes

DOI10.1016/j.ejc.2013.11.004zbMath1282.05066arXiv1205.5877OpenAlexW2101483980MaRDI QIDQ2637237

Sanming Zhou, Alison Thomson

Publication date: 10 February 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.5877

zbMATH Keywords

Cayley graphEisenstein-Jacobi graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (8)

Cyclotomic graphs and perfect codes ⋮ RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Rotational circulant graphs ⋮ A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gossiping and routing in second-kind Frobenius graphs
• New methods for using Cayley graphs in interconnection networks
• The edge-forwarding index or orbital regular graphs
• On isomorphisms of connected Cayley graphs
• On orbital regular graphs and Frobenius graphs
• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
• A survey on Knödel graphs.
• Wiener index of hexagonal systems
• On forwarding indices of networks
• Finding optimal routings in Hamming graphs
• A survey on multi-loop networks.
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
• Gossiping and routing in undirected triple-loop networks
• Group Action Graphs and Parallel Architectures
• Perfect Codes for Metrics Induced by Circulant Graphs
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• A group-theoretic model for symmetric interconnection networks
• Isomorphic Cayley graphs on nonisomorphic groups
• Modeling Toroidal Networks with the Gaussian Integers
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Performance analysis of virtual cut-through switching in HARTS: a hexagonal mesh multicomputer
• The Lattice Point Covering Theorem for Rectangles
• Complete rotations in Cayley graphs

This page was built for publication: Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes