The paper [11] raised the question of describing cardinality and types approximations for natural families theories. In present paper, a partial answer to this is given, study approximation topological properties classes theories also continued. We consider cycle graph consisting one or, in other words, certain number vertices (at least 3 if simple) connected into closed chain. It shown that an...

A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. Much attention has been paid to the metric dimension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimens...