Mean trees (Q2799690)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6568488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mean trees |
scientific article; zbMATH DE number 6568488 |
Statements
13 April 2016
0 references
mean graph
0 references
0 references
0 references
Mean trees (English)
0 references
Given an injective labelling \(f\) of the vertices of a graph \(X\) with non-negative integers, label the edge \(uv\) with \(\lceil\frac{f(u)+f(v)}{2}\rceil\). If all the edge labels are distinct, \(X\) is called a mean graph. The author proves that all trees with at most four leaves, with the sole exception of \(K_{1,4}\), are mean.
0 references
