
A Constructive Classification of Graphs
Author(s) -
M. A. Iordanskii
Publication year - 2015
Publication title -
modelirovanie i analiz informacionnyh sistem
Language(s) - English
Resource type - Journals
eISSN - 2313-5417
pISSN - 1818-1015
DOI - 10.18255/1818-1015-2012-4-144-153
Subject(s) - constructive , intersection (aeronautics) , class (philosophy) , element (criminal law) , indifference graph , set (abstract data type) , mathematics , graph , computer science , pathwidth , combinatorics , discrete mathematics , line graph , artificial intelligence , engineering , process (computing) , law , political science , programming language , aerospace engineering , operating system
The classes of graphs closed regarding the set-theoretical operations of union and intersection are considered. Some constructive descriptions of the closed graph classes are set by the element and operational generating basses. Such bases have been constructed for many classes of graphs. The backward problems (when the generating bases are given and it is necessary to define the characteristic properties of corresponding graphs) are solved in the paper. Subsets of element and operational bases of the closed class of all graphs are considered as generating bases.