New results on the (super) edge-magic deficiency of chain graphs

Summary: Let \(G\) be a graph of order \(v\) and size \(e\). An edge-magic labeling of \(G\) is a bijection \(f : V(G) \cup E(G) \rightarrow \{1,2, 3, \ldots, v + e \}\) such that \(f(x) + f(x y) + f(y)\) is a constant for every edge \(x y \in E(G)\). An edge-magic labeling \(f\) of \(G\) with \(f(V(G)) = \{1,2, 3, \ldots, v \}\) is called a super edge-magic labeling. Furthermore, the edge-magic deficiency of a graph \(G\), \(\mu(G)\), is defined as the smallest nonnegative integer \(n\) such that \(G \cup n K_1\) has an edge-magic labeling. Similarly, the super edge-magic deficiency of a graph \(G\), \(\mu_s(G)\), is either the smallest nonnegative integer \(n\) such that \(G \cup n K_1\) has a super edge-magic labeling or \(+ \infty\) if there exists no such integer \(n\). In this paper, we investigate the (super) edge-magic deficiency of chain graphs. Referring to these, we propose some open problems.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: New results on the (super) edge-magic deficiency of chain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751533)