The Community for Technology Leaders
Green Image
Issue No. 08 - August (1982 vol. 31)
ISSN: 0018-9340
pp: 784-791
G. Memmi , Central Research Laboratory, Thomson-CSF
The (d,k) graph problem which is a stiu open extremal problem in graph theory, has received very much attention from many authors due to its theoretic interest, and also due to its possible applications in communication network design. The problem consists in maximizing the number of nodes n of an undirected regular graph (d,k) of degree d and diameter k. In this paper, after a survey of the known results, we present two new families of graphs, and two methods of generating graphs given some existing ones, leading to further substantial improvements of some of the results gathered by Storwick [21] and recently improved by Arden and Lee [3] and also by Imase and Itoh [11].
Moore graph, Communication network, diameter minimization, (d, k) graph, graph generating operations, graph theory

G. Memmi and Y. Raillard, "Some New Results About the (d, k) Graph Problem," in IEEE Transactions on Computers, vol. 31, no. , pp. 784-791, 1982.
82 ms
(Ver 3.3 (11022016))