Article
Licensed
Unlicensed
Requires Authentication
The structure and methods of generation of closed classes of graphs
-
M. A. Iordanskii
Published/Copyright:
August 1, 2003
We consider a functional approach to a system of graphs with operations: we study the structure of classes of graphs closed with respect to some operations, the total number of closed classes, the number of precomplete classes and methods of generating the classes.
We indicate the systems of operations with respect to which the sets of closed classes of graphs are continual, countable or finite. It is shown that systems of operations realise all possibilities of generation of closed classes of graphs: there exist classes with finite, countable bases, and classes which have no bases.
Published Online: 2003-08-01
Published in Print: 2003-08-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
Articles in the same Issue
- Boolean reducibility
- On the complexity of testing primality by homogeneous structures
- On distinguishability of states of automata
- On glueing states of an automaton
- Almost layer-finiteness of the periodic part of groups without involutions
- The structure and methods of generation of closed classes of graphs
- On asymptotic expansions for the distributions of the number of cycles in a random permutation
