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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:56, 5 March 2024

scientific article
Language Label Description Also known as
English
Decomposition of graphical sequences and unigraphs
scientific article

    Statements

    Decomposition of graphical sequences and unigraphs (English)
    0 references
    15 September 2000
    0 references
    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.
    0 references
    decomposition
    0 references
    graphical sequence
    0 references
    unigraph
    0 references
    0 references

    Identifiers