| We will discuss a procedure which allows to essentially simplify networks' topology while keeping the spectrum of its weighted adjacency matrix. The method is very flexible and, in particular, allows to isospectrally reduce graph to any subset of the networks' nodes. It allows to analyze various structural and functional properties of arbitrary nature networks. |
|