Simulation of Behavior and Intelligence

Extremal subsystems of monotonic systems. III

I. È. Mullat

Tallin

Abstract: The paper is concerned with a possible statement of the problem of locating in a specified graph those parts which are more «saturated» than any others with «small» graphs of the same type. With this formulation the solution is obtained by assembling a monotonic system of structural elements of the graphs (arcs or vertices). The sequence of obtaining a monotonic system from a specified graph is given in a general form and the necessary design is illustrated with examples. The article is an extensition of Refs. [1, 2] and illustrates the tools reported there for locating extremal subsystems for solution of certain problems arising in tournaments, acyclic graphs, in nonoriented and oriented trees.

UDC: 62-50:519.2


Received: 23.02.1976

 English version: Automation and Remote Control, 1977, 38:1, 89–97

Bibliographic databases:

•