BaEa, M., On magic labelings of honeycomb, Discrete Mathematics 105 (1992) 305-311. We deal with the problem of labeling the vertices, edges and faces of a hexagonal planar map in such a way that the label of a face and labels of vertices and edges surrounding that face add up to a fixed value. ##
On magic labelings of Möbius ladders
✍ Scribed by Martin Bača
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 193 KB
- Volume
- 326
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The paper describes prime-magic labeling for the complete bipartite graph K+, andfor L, n > 5, formulates a conjecture.
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain the Mo bius function in various examples including non-cross
Let G be a group acting effectively on a Hausdorff space X, and let Y be an open dense subset of X. We show that the inverse monoid generated by elements of G regarded as partial functions on Y is an F-inverse monoid whose maximum group image is isomorphic to G. We also describe the monoid in terms