Decomposition of graphical sequences and unigraphs
Authors:
Regina Tyshkevich
Affiliation:
Department of Mechanics and Mathematics, The Belarus State University, Minsk, 220050, Republic of Belarus
Abstract:
A binary operation is introduced on the set of graphs and is transferred to graphical sequences. The decomposition theorem stating that any graph and any graphical sequence can be uniquely decomposed into indecomposable components with respect to the operation is proved. An exhaustive description of the structure of unigraphs based on this theorem is given.