Pages that link to "Item:Q4345572"

The following pages link to Counting small cycles in generalized de Bruijn digraphs (Q4345572):

Displaying 12 items.

• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks (Q418321) (← links)
• Radial Moore graphs of radius three (Q427891) (← links)
• Particular cycles of a binary de Bruijn digraph (Q966168) (← links)
• The twin domination number in generalized de Bruijn digraphs (Q989508) (← links)
• On the number of cycles of short length in the de Bruijn-Good graph \(G_ n\) (Q1080434) (← links)
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs (Q1199445) (← links)
• Counting closed walks in generalized de Bruijn graphs (Q1318762) (← links)
• Distance domination of generalized de Bruijn and Kautz digraphs (Q1692700) (← links)
• On the number of cycles in generalized Kautz digraphs (Q1877656) (← links)
• Constructing the minimum dominating sets of generalized de Bruijn digraphs (Q2342640) (← links)
• Hamiltonicity of large generalized de Bruijn cycles (Q2446865) (← links)
• Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)