The following pages link to A survey on multi-loop networks. (Q1874388):
Displaying 49 items.
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- New results on the energy of integral circulant graphs (Q426375) (← links)
- Cycle Kronecker products that are representable as optimal circulants (Q479029) (← links)
- Which weighted circulant networks have perfect state transfer? (Q498029) (← links)
- Spanning trees in directed circulant graphs and cycle power graphs (Q504113) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- On the chromatic number of integral circulant graphs (Q604055) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- Some classes of integral circulant graphs either allowing or not allowing perfect state transfer (Q735132) (← links)
- Rotational circulant graphs (Q741752) (← links)
- Perfect state transfer in integral circulant graphs (Q845652) (← links)
- Forwarding and optical indices of 4-regular circulant networks (Q891819) (← links)
- On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings (Q963458) (← links)
- Perfect state transfer in integral circulant graphs of non-square-free order (Q972791) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- Triple-loop networks with arbitrarily many minimum distance diagrams (Q1024484) (← links)
- On the clique number of integral circulant graphs (Q1033030) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Efficient eight-regular circulants based on the Kronecker product (Q1752463) (← links)
- Greedy routing in circulant networks (Q2127722) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach (Q2162847) (← links)
- On the existence of hyper-L triple-loop networks (Q2497493) (← 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)
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHS (Q2905302) (← links)
- Gossiping and routing in undirected triple-loop networks (Q3057157) (← links)
- Connectivity and diameter in distance graphs (Q3087615) (← links)
- Hamiltonian properties on a class of circulant interconnection networks (Q5012825) (← links)
- Characterization of strongly regular integral circulant graphs by spectral approach (Q5054087) (← links)
- (Q5068490) (← links)
- (Q5150427) (← links)
- (Q5150591) (← links)
- (Q5150645) (← links)
- A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER (Q5151457) (← links)
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS (Q5292260) (← links)
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR (Q5322920) (← links)
- Effective algorithm for finding shortest paths in dense Gaussian networks (Q5871442) (← links)
- (Q5878633) (← links)
- Minimal spread of integral circulant graphs (Q6143872) (← links)
- Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks (Q6180810) (← links)
- Database analysis of optimal double-loop networks (Q6573400) (← links)
- On dispersability of some circulant graphs (Q6616230) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)
- Maximal diameter of integral circulant graphs (Q6647750) (← links)
- A method for automatic search for families of optimal chordal ring networks (Q6648345) (← links)
- The least eigenvalues of integral circulant graphs (Q6655139) (← links)
