Counting closed walks in generalized de Bruijn graphs
type: Item
instance of: scholarly article
title: Counting closed walks in generalized de Bruijn graphs
zbMATH Open document ID: 0792.05063
DOI: 10.1016/0020-0190(94)90090-6
author: Yukio Shibata
author: Miyuki Shirahata
author: Shingo Osawa
published in: Information Processing Letters
publication date: 1994-04-05T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 540902
zbMATH Keywords: counting
zbMATH Keywords: de Bruijn graph
zbMATH Keywords: closed walks
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90090-6
OpenAlex ID: W2036527661
cites work: Q3827949
cites work: Q5834367
cites work: Generalized de Bruijn digraphs
cites work: Design to Minimize Diameter on Building-Block Network
cites work: A Design for Directed Graphs with Minimum Diameter
description: scientific article; zbMATH DE number 540902