Pages that link to "Item:Q1182967"

The following pages link to On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967):

Displaying 12 items.

• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks (Q418321) (← links)
• On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922) (← links)
• The twin domination number in generalized de Bruijn digraphs (Q989508) (← links)
• Error correcting sequence and projective de Bruijn graph (Q1015424) (← links)
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs (Q1297626) (← links)
• On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) (Q1343780) (← links)
• On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks (Q1351611) (← 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)
• Projective de Bruijn Sequences (Q3600437) (← links)
• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs (Q5114859) (← links)