Decomposition of graphical sequences and unigraphs (Q1567622): Difference between revisions

An integer sequence is called graphical if there exists a graph (a realization of the sequence) such that the sequence is the list of its degrees. A unigraph is a graph which degree sequence has a unique realization. A binary operation \(\circ\) is introduced on the class 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 elements with respect to the operation \(\circ\) is proved. Based on this theorem, an exhaustive description of the structure of unigraphs is given.