A Design for (d, k) Graphs

DOI10.1109/PGEC.1966.264310MaRDI QIDQ5521323zbMATH OpenOpenAlexFDO

Authors H. D. Friedman

Publication date 1966

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

Full work available at URL https://doi.org/10.1109/pgec.1966.264310

zbMATH Keywords

topology

Cited in

(3)

• Regular separable graphs of minimum order with given diameter
• High density graphs for processor interconnection
• One method for proving the impossibility of certain Moore graphs

This page was built for publication: A Design for (d, k) Graphs

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