Abstract:
The problem is solved of the construction of a Husimi tree (a connected graph in which each line belongs to not more than one simple cycle) for the case in which the length of simple cycles and the distance between any two points of $x_1, x_2, \dots, x_n$ is known, where $\{x_1, x_2, \dots, x_n\}$ is the set of all simple cycles and all hanging points. A necessary and sufficient condition is found for the existence of such a Husimi tree and its uniqueness is proved.
Fulltext:
PDF file (1282 kB)
