On the number of cycles in generalized Kautz digraphs (Q1877656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting small cycles in generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Imase and Itoh 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
Property / cites work
 
Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting closed walks in generalized de Bruijn graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank

Latest revision as of 20:08, 6 June 2024

scientific article
Language Label Description Also known as
English
On the number of cycles in generalized Kautz digraphs
scientific article

    Statements

    On the number of cycles in generalized Kautz digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    Counting
    0 references
    Cycles
    0 references
    Generalized Kautz digraphs
    0 references
    Interconnection networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references