REPRESENTING DEGREE RESTRICTED TREE USINGAUGMENTED ADJACENCY MATRIX

In graph theory, tree plays an important role due to its structure that can be used to represent many problems such as in desain the telecommunication networks, distribution networks and so on. There are some type of tree representations such as vector representation, adjacency list, permutation, and Prufer’s numbers. For problems that use tree as the key structure, like the DCMST problem, the tree representation by Prufer number is an advantage because in the Prufer number representation we can get information about the degree of the vertex in the tree. The vertex in the tree that has degree r, in the Prufer number representation will appear r-1 times. In this paper we will propose an alternative method for representing degree restricted tree, that is the augmented adjacency matrix.