S. R. Parker and H. J. Lohse, “A direct procedure for the synthesis of network graphs from a given fundamental loop or cutset matrix,” IEEE Transactions on Circuit Theory, Vol. CT-16, pp. 221–223, May 1969.

has been cited by the following article:

• TITLE: Realization of the Linear Tree that Corresponds to a Fundamental Loop Matrix

  AUTHORS: Jianping QIAN, Peng-Yung WOO

  KEYWORDS: Fundamental Loop Matrix, Linear Tree, Graph

  JOURNAL NAME: Wireless Sensor Network, Vol.2 No.1, January 13, 2010

  ABSTRACT: Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link loops that are incident to each tree branch in the fundamental loop matrix Bf. The proposed method judges the pendent properties of the tree branches, determines their order one by one and then achieves the realization of the linear tree. The graph that corresponds to Bf is eventually constructed by adding links to the obtained linear tree. The proposed method can be extended for the realization of a general tree.