Graphs on alphabets as models for large interconnection networks
From MaRDI portal
Publication:1199426
DOI10.1016/0166-218X(92)90135-WzbMath0768.68142MaRDI QIDQ1199426
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
words; labelling; diameter; de Bruijn graph; Kautz graph; Moore bound; maximum degree; bisequence graph; efficient routing algorithms; graphs on alphabets; large interconnection networks
05C35: Extremal problems in graph theory
68R15: Combinatorics on words
68R10: Graph theory (including graph drawing) in computer science
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
94C15: Applications of graph theory to circuits and networks
05C20: Directed graphs (digraphs), tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The diameter of random regular graphs
- Line Digraph Iterations and the (d, k) Digraph Problem
- Families of Fixed Degree Graphs for Processor Interconnection
- Large Graphs with Given Degree and Diameter—Part I
- Some New Results About the (d, k) Graph Problem
- A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs