The results of computer searches for large graphs with given (small) d
egree and diameter are presented. The new graphs are Cayley graphs of
semidirect products of cyclic groups and related groups. One fundament
al use of our ''dense graphs'' is in the design of efficient communica
tion network topologies. (C) 1994 John Wiley & Sons, Inc.