DocumentCode
1104165
Title
Improved Construction Techniques for (d, k) Graphs
Author
Storwick, Robert M.
Author_Institution
IEEE
Issue
12
fYear
1970
Firstpage
1214
Lastpage
1216
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1970.222861
Filename
1671454
Link To Document