On an extension of distance hereditary graphs (Q1025561)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On an extension of distance hereditary graphs
scientific article

    Statements

    On an extension of distance hereditary graphs (English)
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    A graph \(G\) is \(k\)-distance hereditary if and only if for any connected induced subgraph \(H\) of \(G\) the distance between any two vertices in \(H\) is at most \(k\) more than the distance between the same vertices in \(G\). The authors give a forbidden subgraph characterization of such graphs using the chord distance in cycles the the dilation number of a graph.
    0 references
    distance heredity
    0 references
    dilatation number
    0 references
    forbidden configurations
    0 references
    0 references

    Identifiers