Abstract

We consider the structure of a flow network realized from a given terminal capacity matrix. As a result, we show a necessary and sufficient condition that a terminal capacity matrix is possible of realizing any graph. And in the case that the correspondence relation of vertices in a graph G and columns of an elementary terminal capacity matrix T/sub E/ are given, we show a sufficient condition and a necessary condition for the structure of the fundamental graph, for which is possible to realize T/sub E/.

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 call

Disclaimer: 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.