Abstract
AbstractFrom a given composite graph two graphs are derived, which can be interpreted as current and voltage graphs, respectively. It is shown that a complete tree of both graphs is a directed tree of the composite graph. Thus the generation of directed trees is reduced to the generation of complete trees. The matrix belonging to the composite graph is decomposed in the incidence matrices of the current and voltage graphs and in a diagonal matrix whose elements are given by the edge‐weights of the composite graph. The number of directed trees in a composite graph is determined using the incidence matrices of both graphs.
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: International Journal of Circuit Theory and Applications
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.
