Pages that link to "Item:Q1923603"

The following pages link to Embedding trees in recursive circulants (Q1923603):

Displaying 11 items.

• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
• Complete binary trees embeddings in Möbius cubes (Q896018) (← links)
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
• Maximum induced subgraph of a recursive circulant (Q1041770) (← links)
• Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
• Pancyclicity of recursive circulant graphs (Q1603500) (← links)
• The super-connected property of recursive circulant graphs (Q2390328) (← links)
• The (strong) rainbow connection numbers of Cayley graphs on abelian groups (Q2429053) (← links)
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) (Q2474073) (← links)
• Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
• Wiener Index of Hypertree (Q3296832) (← links)