Counting small cycles in generalized de Bruijn digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-D" /><39::AID-NET4>3.0.CO;2-D 10.1002/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-DzbMath0881.90120OpenAlexW2069578031MaRDI QIDQ4345572

Yukio Shibata, Toru Hasunuma

Publication date: 23 July 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199701)29:1<39::aid-net4>3.0.co;2-d

zbMATH Keywords

generalized de Bruijn digraphsmall cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

On the number of cycles in generalized Kautz digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ Radial Moore graphs of radius three ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

This page was built for publication: Counting small cycles in generalized de Bruijn digraphs