Graphs on alphabets as models for large interconnection networks (Q1199426): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of a. kotzig concerning factorizations of 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Graphs with Given Degree and Diameter—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Digraph Iterations and the (d, k) Digraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of Fixed Degree Graphs for Processor Interconnection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Results About the (d, k) Graph Problem / rank
 
Normal rank

Latest revision as of 16:15, 16 May 2024

scientific article
Language Label Description Also known as
English
Graphs on alphabets as models for large interconnection networks
scientific article

    Statements

    Graphs on alphabets as models for large interconnection networks (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bisequence graph
    0 references
    Kautz graph
    0 references
    de Bruijn graph
    0 references
    Moore bound
    0 references
    graphs on alphabets
    0 references
    labelling
    0 references
    words
    0 references
    large interconnection networks
    0 references
    efficient routing algorithms
    0 references
    diameter
    0 references
    maximum degree
    0 references