This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Large Graphs with Given Degree and Diameter?Part I
September 1984 (vol. 33 no. 9)
pp. 857-860
C. Delorme, Department of Mathematics, University Paris-Sud
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:
C. Delorme, G. Farhi, "Large Graphs with Given Degree and Diameter?Part I," IEEE Transactions on Computers, vol. 33, no. 9, pp. 857-860, Sept. 1984, doi:10.1109/TC.1984.1676504
Usage of this product signifies your acceptance of the Terms of Use.