Pages that link to "Item:Q4564058"
From MaRDI portal
The following pages link to Modeling Toroidal Networks with the Gaussian Integers (Q4564058):
Displaying 9 items.
- Tree connectivities of Cayley graphs on abelian groups with small degrees (Q503543) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
- Dense bipartite circulants and their routing via rectangular twisted torus (Q2636804) (← links)
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes (Q2637237) (← links)
- (Q5150427) (← links)
- A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS (Q5151437) (← links)
- Effective algorithm for finding shortest paths in dense Gaussian networks (Q5871442) (← links)