Dense Trivalent Graphs for Processor Interconnection

DOI10.1109/TC.1982.1675977zbMath0477.68068OpenAlexW1845659341MaRDI QIDQ3933761

Marvin Solomon, Will E. Leland

Publication date: 1982

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1982.1675977

zbMATH Keywords

cubic graphsundirected graphsmulticomputerinterconnection topology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (6)

Properties of a class of trivalent network graphs and optimal routing ⋮ Multidimensional linear congruential graphs ⋮ A new routing algorithm for the shuffle-exchange permutation network ⋮ Shortest routing in trivalent Cayley graph network ⋮ Trivalent Cayley graphs for interconnection networks ⋮ Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

This page was built for publication: Dense Trivalent Graphs for Processor Interconnection