| Article ID: | iaor1993631 |
| Country: | Netherlands |
| Volume: | 37/38 |
| Issue: | 1/5 |
| Start Page Number: | 281 |
| End Page Number: | 286 |
| Publication Date: | Jul 1992 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Heinrich Katherine, Kim Kichul, Kumar V.K. Prasanna |
Graphs on alphabets are constructed by labelling the vertices with words on a given alphabet, and specifying a rule that relates pairs of different words to define the edges. They have proved to be quite suitable to model large interconnection networks since their structure usually provides efficient routing algorithms. The aim of this paper is to present several infinite familes of such graphs with a large number of vertices for given values of their diameter and maximum degree.