Abstract
New methods employing an edge-numbering convention are proposed for listing all circuits and cutsets of an arbitrary graph, which are an improvement over the ones recently given by Maxwell and Reed. Storage of a master path matrix, whereby the all-path matrix between any two nodes of a given graph can be derived by simple modification, is discussed. A technique for generation of all trees, including a given set of edges and some significant properties of master path matrices, are also discussed. The algorithms proposed are all suitable for computer adoption.
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 callMore From: Proceedings of the Institution of Electrical Engineers
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.
