English

(Di)graph decompositions and magic type labelings: a dual relation

Combinatorics 2019-07-10 v3

Abstract

A graph GG is called edge-magic if there is a bijective function ff from the set of vertices and edges to the set {1,2,,V(G)+E(G)}\{1,2,\ldots,|V(G)|+|E(G)|\} such that the sum f(x)+f(xy)+f(y)f(x)+f(xy)+f(y) for any xyxy in E(G)E(G) is constant. Such a function is called an edge-magic labelling of G and the constant is called the valence of ff. An edge-magic labelling with the extra property that f(V(G))={1,2,,V(G)}f(V(G))= \{1,2,\ldots,|V(G)|\} is called super edge-magic. In this paper, we establish a relationship between the valences of (super) edge-magic labelings of certain types of bipartite graphs and the existence of a particular type of decompositions of such graphs.

Keywords

Cite

@article{arxiv.1810.03994,
  title  = {(Di)graph decompositions and magic type labelings: a dual relation},
  author = {S. C. López and F. A. Muntaner-Batle and M. Prabu},
  journal= {arXiv preprint arXiv:1810.03994},
  year   = {2019}
}

Comments

11 pages: 4 figures. arXiv admin note: text overlap with arXiv:1602.01337, arXiv:1607.07313, arXiv:1411.7657

R2 v1 2026-06-23T04:33:28.092Z