On chromatic number of natural modular graphs
AbstractThe problem of chromatic number definition for a subclass of numerical graphs, namely natural modular graphs, is raised for the first time. A few affirmations are proved which allow defining the chromatic number of these graphs with the number of generatrixes not over three. To solve a general problem, a method of differences is proposed, possibilities of which are described and an example of its use is given.
New methods in system analysis, computer science and theory of decision making