The Algorithm for the Measurement of Connectivity by Matrix Operation

Abstract

     Connectivity is the index of social network analysis that deals with network data, and has been measured so far by tracing the adjacent relations between nodes. This algorithm is equivalent to the method called depth first search in the field of computer science. It is known that this algorithm is so efficient for detection of the depth of the data that has graph structure. Through taking advantage of Path theorem in graph theory and the nature of diameter of graph, however, it is possible to measure connectivity by simple matrix operation. In this study we present algorithm for measurement of connectivity based on matrix operation, and after demonstration of the algorithm using few examples we define connectivity as graph theoretical terms.