Abstract
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 shortest paths are shown as objects which are generated by norms introduced into the vector spaces of the edge and vertex flows. If using the Euclidean norm one gets an advantage in doing analysis and synthesis of graphs in comparison to traditional metrics. The proposed metric can be used to generate the behaviour of intelligent agents.
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.
