Pages that link to "Item:Q2905302"

The following pages link to A SURVEY ON UNDIRECTED CIRCULANT GRAPHS (Q2905302):

Displaying 26 items.

• A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
• Searching for large multi-loop networks (Q283713) (← links)
• Tight-optimal circulants vis-à-vis twisted tori (Q401131) (← links)
• Cycle Kronecker products that are representable as optimal circulants (Q479029) (← links)
• New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs (Q729771) (← links)
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs (Q785836) (← 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)
• New Moore-like bounds and some optimal families of abelian Cayley mixed graphs (Q2189569) (← links)
• The degree/diameter problem for mixed abelian Cayley graphs (Q2403806) (← links)
• Generalized 3-(edge)-connectivity for undirected double-loop networks (Q2831803) (← links)
• Searching for (near) Optimal Codes (Q3467868) (← links)
• (Q5041859) (← links)
• (Q5068490) (← links)
• NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS (Q5151234) (← links)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS (Q5151437) (← links)
• A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER (Q5151457) (← links)
• A note on some distance-based topological indices of circulant network <i>C_n</i>(1, <i>a</i>) (Q5865663) (← links)
• (Q5878633) (← links)
• New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes (Q6112234) (← links)
• Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks (Q6180810) (← links)
• The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter (Q6497314) (← links)
• Further studies on circulant completion of graphs (Q6586867) (← links)
• On the broadcast independence number of circulant graphs (Q6637055) (← links)
• A method for automatic search for families of optimal chordal ring networks (Q6648345) (← links)