Abstract
Metric tasks often arise as a simplification of complex and practically important problems on graphs. The correspondence between the search algorithms of the usual shortest paths and Markov chains is shown. From this starting point a sequence of matrix descriptions of undirected graphs is established. The sequence ends with the description of the explicit form of the Moore-Penrose pseudo inversed incidence matrix. Such a matrix is a powerful analytical and computational tool for working with edge flows with conditionally minimal Euclidian norms. The metrics of a graph are represented as its characteristics generated by the norms of linear spaces of edge and vertex flows. The Euclidian metric demonstrates the advantages of the practice of solving problems on graphs in comparison with traditional metrics based on the shortest paths or minimal cuts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
