Counting closed walks in generalized de Bruijn graphs (Q1318762): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3827949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5834367 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized de Bruijn digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Design to Minimize Diameter on Building-Block Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank | |||
Normal rank | |||
Latest revision as of 14:22, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting closed walks in generalized de Bruijn graphs |
scientific article |
Statements
Counting closed walks in generalized de Bruijn graphs (English)
0 references
5 April 1994
0 references
The generalized de Bruijn graph \(G(n,d)\) is a directed graph with \(n\) vertices \(i\), \(0 \leq i \leq n-1\), and with arcs from \(i\) to \(di+r \pmod n\), \(0 \leq r \leq d-1\). The authors derive a formula for the number of distinct closed walks of length \(k\) in \(G(n,d)\), among other things.
0 references
counting
0 references
de Bruijn graph
0 references
closed walks
0 references
