Characterization of graphs with equal bandwidth and cyclic bandwidth (Q5957762)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterization of graphs with equal bandwidth and cyclic bandwidth |
scientific article; zbMATH DE number 1719017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8777468
0 references
0.8733966
0 references
0.8733966
0 references
0 references
