The algorithm of its construction is as follows: initially (n = 0), [C.sub.k,l,0] is a

cyclic graph with the size l.

The total distance of every node of

cyclic graph [C.sub.n] is equal to [n.sup.2] /4 where n is even integer and otherwise is ([n.sup.2] -1)/4.

In the relation above value of [E.sub.D] is absorbed energy inside full loop which corresponds complete level of a cycle ([A.sub.loop]) and [E.sub.S0] is elastic strain energy corresponds force maximum ([F.sub.max]) and displacement ([D.sub.max])obtained in a cycle of

cyclic graph which have been shown on the following force-displacement figure (figure

The theory of a

cyclic graphs was developed for solving problems of electrical networks and the study of trees was developed for enumerating isomers of organic compounds.

Ivan Gutman [3] introduced a generalization of the Wiener index for

cyclic graphs called Szeged index.