Diameter of a Graph

The number of links (edges) between the furthest nodes (2 and 7) of this graph is 4. Consequently, the diameter of this graph is 4. The highest value of the topological distance of this matrix is the diameter of the graph (d=4). In the case of a non-oriented graph, the matrix is transposable.

Home | Contents | Media | Glossary | Links | About | Contact | Purchase

Copyright © 1998-2012, Dr. Jean-Paul Rodrigue, Dept. of Global Studies & Geography, Hofstra University, New York, USA.
This material (including graphics) cannot be copied or redistributed, in whole or in part, in ANY FORM (printed or electronic) and on ANY MEDIA. For specific uses permission MUST be requested and the material must be cited.