The cyclic wirelength of trees (Q1270789)
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: The cyclic wirelength of trees |
scientific article; zbMATH DE number 1218483
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cyclic wirelength of trees |
scientific article; zbMATH DE number 1218483 |
Statements
The cyclic wirelength of trees (English)
0 references
7 March 1999
0 references
A tree \(T\) on \(n\) vertices can be embedded in an \(n\)-cycle \(C\) or in a path \(L\) of order \(n\). The ``cyclic'' or ``linear wirelength'' of \(T\) can be defined by using the number of paths joining endvertices of edges of \(T\) in these host graphs. By a theorem of Hall the authors show that these two wirelengths coincide.
0 references
wirelength
0 references
tree
0 references
cycle
0 references
path
0 references
