Dense Trivalent Graphs for Processor Interconnection

DOI10.1109/TC.1982.1675977MaRDI QIDQ3933761zbMATH OpenOpenAlexFDO

Authors Will E. Leland, Marvin Solomon

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 graphsinterconnection topologymulticomputerundirected graphs

Mathematics Subject Classification ID

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

Cited in

(6)

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

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

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