Graphs on alphabets as models for large interconnection networks

DOI10.1016/0166-218X(92)90135-WMaRDI QIDQ1199426zbMATH OpenOpenAlexFDO

Authors 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

bisequence graphde Bruijn graphdiameterefficient routing algorithmsgraphs on alphabetsKautz graphlabellinglarge interconnection networksmaximum degreeMoore boundwords

Mathematics Subject Classification ID

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

Recommendations

• Edge-colorings of some large graphs on alphabets
• scientific article; zbMATH DE number 4055643
• scientific article; zbMATH DE number 6004
• Connections between two cycles --- a new design of dense processor interconnection networks
• Cycle prefix digraphs for symmetric interconnection networks

Cites work

• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• Families of Fixed Degree Graphs for Processor Interconnection
• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3859160 (Why is no real title available?)
• scientific article; zbMATH DE number 3939392 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3432305 (Why is no real title available?)
• scientific article; zbMATH DE number 3412694 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Large Graphs with Given Degree and Diameter—Part I
• Line Digraph Iterations and the (d, k) Digraph Problem
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• Some New Results About the (d, k) Graph Problem
• The diameter of random regular graphs

Cited in

(12)

• Diameter vulnerability of GC graphs
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• Some new large compound graphs
• Edge-connectivity and edge-superconnectivity in sequence graphs
• Asymptotically large (\(\Delta,D\))-graphs
• Capillary graph-interfaces ``in-the-large
• scientific article; zbMATH DE number 4055643 (Why is no real title available?)
• Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
• Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
• Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
• Graph constructions derived from interconnection networks
• On some metric properties of supertoken graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199426)