Characterization of graphs with equal bandwidth and cyclic bandwidth (Q5957762)

From MaRDI portal
Revision as of 03:35, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1719017
Language Label Description Also known as
English
Characterization of graphs with equal bandwidth and cyclic bandwidth
scientific article; zbMATH DE number 1719017

    Statements

    Characterization of graphs with equal bandwidth and cyclic bandwidth (English)
    0 references
    10 October 2002
    0 references
    The authors provide a characterization of graphs with equal bandwidth and cyclic bandwidth. Certain classes of graphs are shown to have the property.
    0 references
    convex triangulation meshes
    0 references
    characterization
    0 references
    bandwidth
    0 references
    cyclic bandwidth
    0 references

    Identifiers