Title :
Large Graphs with Given Degree and Diameter—Part I
Author :
Delorme, Charles ; Farhi, G.
Author_Institution :
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△∞inf N(△, D).△-D ≥ 2-D, where N(△, D) is the maximum number of vertices of a graph with degree A and diameter D.
Keywords :
(d, k)-graph problem; interconnection networks; regular networks; undirected graphs; Automation; Mathematics; Microprocessors; Modular construction; Multiprocessor interconnection networks; (d, k)-graph problem; interconnection networks; regular networks; undirected graphs;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676504
