Lattice bandwidth of random graphs (Q810061): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
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
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
