A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T
✦ LIBER ✦
Labelings of a certain class of convex polytopes
✍ Scribed by M. Bača; I. Holländer
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 407 KB
- Volume
- 329
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Convex labelings of trees
✍
Stephen J. Dow; Douglas F. Rall; Peter J. Slater
📂
Article
📅
1987
🏛
John Wiley and Sons
🌐
English
⚖ 456 KB
Heights of convex polytopes
✍
Victor Klee
📂
Article
📅
1965
🏛
Elsevier Science
🌐
English
⚖ 663 KB
Inner Diagonals of Convex Polytopes
✍
David Bremner; Victor Klee
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 249 KB
to branko gru nbaum in honor of his seventieth birthday An inner diagonal of a polytope P is a segment that joins two vertices of P and that lies, except for its ends, in P's relative interior. The paper's main results are as follows: (a) Among all d-polytopes P having a given number v of vertices,
A class of Hamiltonian polytopes
✍
P. R. Goodey
📂
Article
📅
1977
🏛
John Wiley and Sons
🌐
English
⚖ 208 KB
## Abstract It is shown that any simple 3‐polytope, all of whose faces are triangles or hexagons, admits a hamiltonian circuit.
On the diameter of convex polytopes
✍
Peter Kleinschmidt; Shmuel Onn
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 171 KB
On a class of Hamiltonian polytopes
✍
Stanislav Jendrol̆; Peter Mihók
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 652 KB