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

TL;DR

This paper explores the relationship between edge-magic labelings of bipartite graphs and specific graph decompositions, providing insights into their structural properties and labeling characteristics.

Contribution

It establishes a novel connection between valences of (super) edge-magic labelings and certain graph decompositions for bipartite graphs.

Findings

Link between edge-magic labelings and graph decompositions

Characterization of valences for bipartite graphs

Conditions for super edge-magic labelings

Abstract

A graph $G$ is called edge-magic if there is a bijective function $f$ from the set of vertices and edges to the set $\{1,2,\ldots,|V(G)|+|E(G)|\}$ such that the sum $f(x)+f(xy)+f(y)$ for any $xy$ in $E(G)$ is constant. Such a function is called an edge-magic labelling of G and the constant is called the valence of $f$. An edge-magic labelling with the extra property that $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.