Pages that link to "Item:Q1041770"

The following pages link to Maximum induced subgraph of a recursive circulant (Q1041770):

Displaying 12 items.

• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
• Minimum neighborhood in a generalized cube (Q1045906) (← links)
• Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
• Sets of binary sequences with small total Hamming distances (Q1628681) (← links)
• A lower bound on the size of \(k\)-neighborhood in generalized cubes (Q2506321) (← links)
• Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
• Recognizing recursive circulant graphs (extended abstract) (Q2816083) (← links)
• The congestion of generalized cube communication pattern in linear array network (Q2929617) (← links)
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) (Q5187853) (← links)
• On linear layout of bicube and construction of optimal incomplete bicube (Q6130207) (← links)