On some properties of n-sequentially connected chain

It is introduced the class of the nonoriented n-sequentially connected chain. It is considered the application fields of the n-sequentially connected chains, in particular the problems of optimal location in discrete formulations, and the problems of selection the optimal conduct in systems, described by Markov controllable processes. The main characteristics of n-sequentially connected chains, such as the number of edges, the size of the maximum clique, the chromatic and the cyclomatic numbers, etc. are given. The relations of the class n-sequentially connected chains to perfect, triangulated, composite and splittable classes of graphs are determined.