A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
From MaRDI portal
Publication:2905302
DOI10.1142/S1793830912500024zbMath1247.05115OpenAlexW2105099851MaRDI QIDQ2905302
Publication date: 27 August 2012
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830912500024
Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (22)
Sixty years of network reliability ⋮ Greedy routing in circulant networks ⋮ Searching for large multi-loop networks ⋮ Searching for (near) Optimal Codes ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ Tight-optimal circulants vis-à-vis twisted tori ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes ⋮ Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks ⋮ Unnamed Item ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Unnamed Item ⋮ NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ 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 ⋮ New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs ⋮ Generalized 3-(edge)-connectivity for undirected double-loop networks ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs ⋮ A note on some distance-based topological indices of circulant network Cn(1, a) ⋮ A family of efficient six-regular circulants representable as a Kronecker product
Cites Work
- Unnamed Item
- Finding shortest paths in distributed loop networks
- Diameter lower bounds for Waring graphs and multiloop networks
- Large graphs with given degree and diameter. II
- Modeling hexagonal constellations with Eisenstein-Jacobi graphs
- Optimal routing in double loop networks
- Hamiltonian decomposition of Cayley graphs of degree 4
- Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Multiplicative circulant networks. Topological properties and communication algorithms
- Fault-tolerant routings in double fixed-step networks
- A survey on interval routing
- On the spectral Ádám property for circulant graphs
- On isomorphisms of finite Cayley graphs---a survey
- A survey on multi-loop networks.
- Cyclic graphs
- Enumeration of cyclic graphs and cyclic designs
- NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
- Minimal diameter double-loop networks: Dense optimal families
- Circulants and their connectivities
- A combinatorial problem related to distributed loop networks
- Reliable circulant networks with minimum transmission delay
- A survey of gossiping and broadcasting in communication networks
- Tight Bounds on the Diameter of Gaussian Cubes
- Minimal diameter double-loop networks. I. Large infinite optimal families
- Computing the Diameter in Multiple-Loop Networks
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Extremal Problems in the Construction of Distributed Loop Networks
- Which generalized petersen graphs are cayley graphs?
- Codes over tori
- Triple Loop Networks with Minimal Transmission Delay
- Fault-tolerant routing in distributed loop networks
- Fault-tolerant routings in chordal ring networks
- The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- Undirected loop networks
- Reliable broadcasting in double loop networks
- Point-symmetric graphs with a prime number of points
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Fault-tolerant broadcasting and gossiping in communication networks
- A complementary survey on double-loop networks
- All-to-all optical routing in chordal rings of degree 4
This page was built for publication: A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
