On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Xue Liang Li / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Fu Ji Zhang / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Roots and Canonical Forms for Circulant Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3680833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5834367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636912 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized de Bruijn digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / 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 | |||
Property / cites work | |||
Property / cites work: Q3764182 / rank | |||
Normal rank |
Latest revision as of 14:35, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs |
scientific article |
Statements
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (English)
0 references
28 June 1992
0 references
The authors determine the number of spanning trees and the number of Eulerian tours in generalized de Bruijn graphs.
0 references
spanning trees
0 references
Eulerian tours
0 references
de Bruijn graphs
0 references