From a structure to a tree
- 1 December 1983
- journal article
- research article
- Published by Taylor & Francis in Civil Engineering Systems
- Vol. 1 (2) , 95-106
- https://doi.org/10.1080/02630258308970324
Abstract
A graph is decomposed into a series of overlapping clusters. The tightness of a cluster is measured by the trace of the third power of the interaction matrix of the graph. The clusters are linked to form a new graph, which is decomposed into a tree according to the closeness of the clusters: the concept of the closeness is analogus to the general gravitational law. The initial graph is not restricted to a series of binary relationships: both nodes and links may be assigned weights, and the links may be directed and asymmetric.Keywords
This publication has 1 reference indexed in Scilit: