A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Matrices, shortest paths, minimal cuts and Euclidian metric for undirected graphs
2018
Procedia Computer Science
In the framework of the algebraic approach to looking into characteristics of undirected graphs, the sequence of their matrix representations has been established. The specifics of the matrices in such a sequence makes it possible at last to make a supposition about the explicit form of the Moore-Penrose pseudo inverse of the incidence matrix of an undirected graph. The rightness of the hypothesis has been confirmed by checking using the conditions of Penrose. The usual minimal cuts and
doi:10.1016/j.procs.2018.11.104
fatcat:tdmbgyi6jrh5rf7ylw6ca7ivze