Graphs on alphabets as models for large interconnection networks

DOI10.1016/0166-218X(92)90135-WzbMath0768.68142OpenAlexW2072271413MaRDI QIDQ1199426

S. Singh

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90135-w

zbMATH Keywords

wordslabellingdiameterde Bruijn graphKautz graphMoore boundmaximum degreebisequence graphefficient routing algorithmsgraphs on alphabetslarge interconnection networks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing ⋮ Diameter vulnerability of GC graphs ⋮ Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ Superfluous edges and exponential expansions of de Bruijn and Kautz graphs ⋮ Asymptotically large (\(\Delta,D\))-graphs ⋮ Some new large compound graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs on alphabets as models for large interconnection networks