Bandwidth of theta graphs with short paths (Q1197053)
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: Bandwidth of theta graphs with short paths |
scientific article; zbMATH DE number 89924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bandwidth of theta graphs with short paths |
scientific article; zbMATH DE number 89924 |
Statements
Bandwidth of theta graphs with short paths (English)
0 references
16 January 1993
0 references
This paper deals with the bandwidth problem of a vertex labeling of so- called theta graphs being graphs with two vertices connected by several vertex-disjoint paths. The authors succeed in giving formulae for bandwidth of theta graphs and presenting well-readable proofs and describing bandwidth labelings of special theta graphs.
0 references
bandwidth
0 references
theta graphs
0 references
short paths
0 references
vertex labeling
0 references
