Bandwidth of theta graphs with short paths (Q1197053): Difference between revisions
From MaRDI portal
Latest revision as of 11:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bandwidth of theta graphs with short paths |
scientific article |
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
