High density graphs for processor interconnection

DOI10.1016/0020-0190(81)90107-1MaRDI QIDQ1153674zbMATH OpenOpenAlexFDO

Authors Li Qiao, Marvin Solomon, Leonard Uhr, Will E. Leland, Raphael Ari Finkel

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(81)90107-1

zbMATH Keywords

computer networkmulticomputerinterconnection graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Cites work

• 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?)
• A Design for (d, k) Graphs
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• Design to Minimize Diameter on Building-Block Network
• Improved Construction Techniques for (d, k) Graphs
• On Moore Graphs with Diameters 2 and 3
• On the Equivalence of Finite-State Sequential Machine Models
• On the impossibility of certain Moore graphs
• Parallel concepts in graph theory
• The Design of Small-Diameter Networks by Local Search
• The Indirect Binary n-Cube Microprocessor Array

Cited in

(1)

• Tables of large graphs with given degree and diameter

This page was built for publication: High density graphs for processor interconnection

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