Cycle Kronecker products that are representable as optimal circulants
DOI10.1016/j.dam.2014.08.027zbMath1304.05126OpenAlexW2024824192MaRDI QIDQ479029
Pranava K. Jha, Jonathan D. H. Smith
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.027
cyclesKronecker productcirculant graphsdouble-loop networkschordal ringsgraphs and networksnetwork topology
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight-optimal circulants vis-à-vis twisted tori
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Isomorphism of circulant graphs and digraphs
- A survey on multi-loop networks.
- Cyclic graphs
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
- Circulants and their connectivities
- A combinatorial problem related to distributed loop networks
- Reliable circulant networks with minimum transmission delay
- Minimal diameter double-loop networks. I. Large infinite optimal families
- A Combinatorial Problem Related to Multimodule Memory Organizations
- PRODUCTS OF CIRCULANT GRAPHS
- Optimal distance networks of low degree for parallel computers
- Hamiltonian decompositions of products of cycles
This page was built for publication: Cycle Kronecker products that are representable as optimal circulants
