Lattice bandwidth of random graphs (Q810061)

From MaRDI portal
Revision as of 19:36, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1227010)
scientific article
Language Label Description Also known as
English
Lattice bandwidth of random graphs
scientific article

    Statements

    Lattice bandwidth of random graphs (English)
    0 references
    0 references
    1991
    0 references
    The lattice bandwidth B(G) of a graph is defined as the minimum diameter of any graph isomorphic to G embedded on a multidimensional integer lattice. Probabilistic properties of B(G) are given for Bernoulli graphs G.
    0 references
    graph labelling
    0 references
    random graphs
    0 references
    lattice bandwidth
    0 references
    Bernoulli graphs
    0 references

    Identifiers