КАНОНИЧЕСКОЕ РАЗЛОЖЕНИЕ ГРАФА, ОПРЕДЕЛЯЕМОГО СТЕПЕНЯМИ ЕГО ВЕРШИН

Abstract

The paper continues the series of the present authors' works dealing with unigraphs. The composition + of graphs is specified. The unigraphs minimal relative to +are defined and for each unigraph the unique decomposition into minimal ones isfound. The unlabeled unigraphs are enumerated by the number of vertices. The automorphismgroup of a unigraph is described. Some algorithms are given.