A Design for (d, k) Graphs
From MaRDI portal
Publication:5521323
DOI10.1109/PGEC.1966.264310zbMath0144.45402OpenAlexW2024740967MaRDI QIDQ5521323
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
Related Items
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
