Improved Construction Techniques for (d, k) Graphs
- 1 December 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (12) , 1214-1216
- https://doi.org/10.1109/t-c.1970.222861
Abstract
Some attention is currently directed toward maximizing the number of nodes in a graph, each node of which receives no more than d branches and may be reached from any other node along a path of no more than k branches. This note introduces two improved techniques for construction and provides a table (with 1≤d, k≤10) indicating the current status of this problem.Keywords
This publication has 0 references indexed in Scilit: