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 :
(d,k) graph, Moore graphs, nonidentical blocking, nonidentical hinging, subgraph.; (d,k) graph, Moore graphs, nonidentical blocking, nonidentical hinging, subgraph.;
