Pages that link to "Item:Q3141771"
From MaRDI portal
The following pages link to Cycle prefix digraphs for symmetric interconnection networks (Q3141771):
Displaying 22 items.
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Large Cayley digraphs of given degree and diameter (Q658078) (← links)
- Which Faber-Moore-Chen digraphs are Cayley digraphs? (Q708363) (← links)
- Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter (Q968411) (← links)
- On large vertex-symmetric digraphs (Q1024427) (← links)
- Connections between two cycles --- a new design of dense processor interconnection networks (Q1199411) (← links)
- Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
- Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
- Connectivities of minimal Cayley coset digraphs (Q1349306) (← links)
- Digraphs on permutations (Q1377815) (← links)
- Broadcasting in cycle prefix digraphs (Q1392525) (← links)
- Weakly distance-regular digraphs. (Q1426099) (← links)
- Asymptotically approaching the Moore bound for diameter three by Cayley graphs (Q1633751) (← links)
- Vertex-symmetric digraphs with small diameter (Q1805459) (← links)
- IEH graphs. A novel generalization of hypercube graphs (Q1902299) (← links)
- Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups (Q2174095) (← links)
- A new general family of mixed graphs (Q2328097) (← links)
- Large Cayley digraphs and bipartite Cayley digraphs of odd diameters (Q2400546) (← links)
- The permutational graph: A new network topology (Q2703011) (← links)
- Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter (Q3055906) (← links)
- Large vertex-transitive and Cayley graphs with given degree and diameter (Q3439606) (← links)
- Uni-directional alternating group graphs (Q6085746) (← links)
