Add to ORKGA (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p+q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In this paper, we introduce the concept of strong super edge-magic labeling as a particular class of super edge-magic labelings and we use such labelings in order to show that the number of super edge-magic labelings of an odd union of path-like trees (mT), all of them of the same order, grows at least exponentially with m
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of v...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) →...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
AbstractWe generalize the notion of the super edge-magic labeling of graphs to the notion of the sup...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of v...
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) →...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
AbstractWe generalize the notion of the super edge-magic labeling of graphs to the notion of the sup...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
In this paper, a complete characterization of the (super) edge-magic linear forests with two compone...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of v...