Distance matrices are much richer algebraic structures than the adjacency matrices [12,18]. They are also square V × V symmetric matrices whose entries are graph-theoretical distances between the vertices. Augmented distance matrices have non-zero values on the main diagonal.
1. The Standard or Vertex-Distance Matrix
2. The Vertex-Distance-Path Matrix
3. The Reciprocal Vertex-Distance-Path-Matrix
4. The Vertex-Distance-Delta Matrix
5. The Edge-Distance Matrix
6. The Vertex-Distance-Complement Matrix
7. The Augmented Vertex-Distance Matrix
8. The Edge-Weighted Vertex-Distance Matrix
9. The Barysz Vertex-Distance Matrix
10. The Complement of the Barysz Vertex-Distance Matrix
11. The Reciprocal Barysz Vertex-Distance Matrix
12. The Reciprocal of the Complement of the Barysz Vertex-Distance Matrix
13. The Complementary Vertex-Distance Matrix
14. The Reciprocal of the Complementary Vertex-Distance Matrix
15. The Detour Matrix
16. The Detour-Path Matrix
17. The Detour-Delta Matrix
18. The Edge-Weighted Detour Matrix
19. The Maximum-Minimum Path Matrix
20. The Detour-Complement Matrix
21. The Vertex-Distance Matrix and the Detour Matrix of Complete Graphs and Complete Bipartite Graphs
22. The Vertex-Harary Matrix
23. The Edge-Harary Matrix
24. The Edge-Weighted-Harary Matrix
25. The Modified Edge-Harary Matrix
26. The Distance-Degree Matrices
27. The Resistance-Distance Matrix
28.
Distance/Distance Matrices