| Article ID: | iaor20021362 |
| Country: | Belgium |
| Volume: | 39 |
| Issue: | 4 |
| Start Page Number: | 147 |
| End Page Number: | 157 |
| Publication Date: | Jan 1999 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Nuffelen Cyriel Van, Rompay Kristel Van |
| Keywords: | matrices |
New bounds for the diameter of a graph are introduced. For undirected graphs, two improvements of an old bound are presented. The first one is formulated in terms of the rank of the adjacency matrix, the second one in terms of its eigenvalues. Further, two known bounds for undirected graphs are extended to directed graphs, by using the minimum polynomial, respectively the rank of the adjacency matrix.