The Community for Technology Leaders
Green Image
Issue No. 09 - September (1984 vol. 33)
ISSN: 0018-9340
pp: 857-860
C. Delorme , Department of Mathematics, University Paris-Sud
ABSTRACT
The following problem arises in the study of interconnection networks: find graphs of given diameter and degree having the maximum number of vertices. In this correspondence we give some constructions of graphs proving in particular that lim?8inf N(?, D).?-D = 2-D, where N(?, D) is the maximum number of vertices of a graph with degree A and diameter D.
INDEX TERMS
undirected graphs, (d, k)-graph problem, interconnection networks, regular networks
CITATION
G. Farhi, C. Delorme, "Large Graphs with Given Degree and Diameter?Part I", IEEE Transactions on Computers, vol. 33, no. , pp. 857-860, September 1984, doi:10.1109/TC.1984.1676504
98 ms
(Ver )