Pages that link to "Item:Q490264"
From MaRDI portal
The following pages link to The degree-diameter problem for circulant graphs of degree 8 and 9 (Q490264):
Displayed 10 items.
- Searching for large multi-loop networks (Q283713) (← links)
- The degree-diameter problem for circulant graphs of degrees 10 and 11 (Q724874) (← links)
- Efficient eight-regular circulants based on the Kronecker product (Q1752463) (← links)
- Greedy routing in circulant networks (Q2127722) (← links)
- On the non-existence of Abelian Moore Cayley graphs with excess one (Q5051445) (← links)
- (Q5068490) (← links)
- (Q5150645) (← links)
- NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS (Q5151234) (← links)
- (Q5878633) (← links)
- Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks (Q6180810) (← links)