𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Prime-magic labelings of Kn,n

✍ Scribed by M. Bača; I. Holländer

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
195 KB
Volume
327
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

The paper describes prime-magic labeling for the complete bipartite graph K+, andfor L, n > 5, formulates a conjecture.

📜 SIMILAR VOLUMES

On magic labelings of honeycomb
On magic labelings of honeycomb
✍ M. Bača 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 312 KB

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. ##

Disconnected graphs with magic labelings
Disconnected graphs with magic labelings
✍ R.H. Jeurissen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 729 KB

We characterise edges in mixed graphs that get a iabel 0 for every labeling with a constant index (index 0, respectively). We use this to investigate the magicity of disconnected mixed graphs with magic components. For the undirected case a necessary and sufficient condition is derived. We consider

On prime labellings
On prime labellings
✍ Hung-Lin Fu; Kuo-Ching Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 347 KB

IS called a prime labelling if for each e = {u, u} in E, we have GCD(f(u),f(u))= 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conject

On magic labelings of type (1,1,1) for t
On magic labelings of type (1,1,1) for the special class of plane graphs
✍ Martin Bača 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 237 KB

The paper describes special ma~qic labelings gf' vertices, edges and ,faces qf' a special class of plane graphs ltlith 3-sided internal f&es, in which the labels of vertices and e&es incident with a,fkce sum to a value prescribedfor that face.

A Hamiltonian game on Kn,n
A Hamiltonian game on Kn,n
✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Let K,,, be the complete bipartite graph of order 2n. Two players, maker and breaker, alternately take previously untaken edges of K,.,, one edge per move, with the breaker going first. The game ends when all edges of K,,, have been taken. Then the edges taken by the maker induce a graph G. The make