engleski

The efficiency links on a graph in transportion network

The access to a single vertex of non-directional transportation network graph can be defined in various ways, but if we want to classify the vertices and at the same time avoid ambiguity, then each of them has to be assigned a cetain number. The paper uses the method for determining the access to a single vertex based on the description of the transportation network using the symmetrical matrix of incidence. By knowing the matrix of incidence it is possible to determine the eigenvalues i.e. eigenvectors, and their comparison determines the values for single vertices. Apart from describing the method, the concrete example of the tram network of the city of Zagreb has been analysed. Based on the obtained analysis results, it is possible to determine the efficiency of connecting single vertices in the considered transportation network, i.e. to propose its improvements.

graph; links on a graph; transportation network

nije evidentirano