Pages that link to "Item:Q1318762"
From MaRDI portal
The following pages link to Counting closed walks in generalized de Bruijn graphs (Q1318762):
Displaying 8 items.
- The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks (Q418321) (← links)
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
- The twin domination number in generalized de Bruijn digraphs (Q989508) (← 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)
- Bounds on the number of closed walks in a graph and its applications (Q2405633) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
