ABSTRACT
Graphs, adequately labeled, may be associated with several matrices.^ A graph G is labeled if a certain numbering of vertices of G is introduced. Here two graph-theoretical matrices, i.e., the adjacency matrix and the distance matrix will be discussed. They are also sometimes referred to as topological matrices.^ These matrices may be used for identifying certain properties of graphs, which would not otherwise easily emerge.
