Characterization of graphs with equal bandwidth and cyclic bandwidth (Q5957762): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:23, 30 January 2024
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
