Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477)

From MaRDI portal
Revision as of 21:36, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decomposition and \(l_1\)-embedding of weakly median graphs
scientific article

    Statements

    Decomposition and \(l_1\)-embedding of weakly median graphs (English)
    0 references
    0 references
    0 references
    2 August 2001
    0 references
    The authors give a structure theory for finite weakly median graphs. They show that each such graph can be obtained by successive applications of gated amalgamations from Cartesian products of members in a short list of certain prime graphs. Furthermore they show that any such graph admits a distance-preserving embedding (\(l_1\)-embedding) into some Euclidean space. There is a scale-2-embedding into some hypercube if and only if the graph does not contain an induced subgraph \(K_{1,1,1,1,2}\).
    0 references
    weakly median graphs
    0 references
    gated amalgamations
    0 references
    prime graphs
    0 references
    embedding
    0 references

    Identifiers