Information estimations of complexity structures

The paper describes the results of the information analysis of the complex structures represented by graphs. The obtained information estimations (IE) of structures are based on an entropy measure of C. Shannon. The orthogonal characteristics of the graphs are taken into account: nodes and contours (paths for "tree" type graphs). The obtained IE is univalent for both nonisomorphic and isomorphic graphs, algorithmically, it is asymptotically steady and has vector character. These IE can be used for the solution of problems of ranking structures by preference, the evaluation of the structurization of a subject area, the solution of the problems of structural optimization. Information estimations and the method of information analysis of structures can be used in many fields of knowledge (electrical systems and circuits, image recognition, computer technology, databases and knowledge bases, organic chemistry, biology and others) and it can be base for the structure calculus.