Elsevier

Computer-Aided Design

Volume 7, Issue 3, July 1975, Pages 157-159
Computer-Aided Design

Generation of all possible trees of a graph in independent groups

https://doi.org/10.1016/0010-4485(75)90004-4Get rights and content

Abstract

A special graph, the PS graph, is introduced and an algorithm is developed to generate all trees of such graphs. It is proved that for any given graph, G there exists certain number of PS graphs, obtained from G, such that the collection of all trees of all such PS graph span all trees of G with no duplication. In addition to a number of properties of PS graphs indicated, the procedure seems very useful for topological analysis and design of networks, or any other types of systems that can be represented by a linear graph.

References (9)

  • S. Precival

    The solution of passive electrical networks by means of mathematical trees

  • W.K. Chen

    Topological analysis for active networks

    IEEE Trans. Circuit Theory

    (March 1965)
  • J. Katzenelson

    Symbolic analysis of linear networks: a survey

  • S.D. Shieu et al.

    Topological formulation of symbolic network functions and sensitivity analysis of active networks

    IEE Trans. Circuit Theory

    (January 1974)
There are more references available in the full text version of this article.

Cited by (4)

View full text