In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labelings and optimal k-equitable labelings. We establish, with the help of the product ⊗h, new relations between super edge-magic labelings and optimal k-equitable labelings and between super edge-magic labelings and edge bi-magic labelings. We also introduce new families of graphs that are inspired by the family of generalized Petersen graphs. The concepts of super bi-magic and r-magic labelings are also introduced and discussed, and open problems are proposed for future research.The research conducted in this document by first and third author has been supported by the Spanish Research Council under project MTM2008- 06620-C03-01 and by the Catala...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
The -product that is referred in the title was introduced in 2008 as a generalization of the Kroneck...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
Let G be a graph of order p and size q with loops allowed. A bijective function f:V(G)∪E(G)→{i}p+qi=...
A graph G of order p and size q is edge-magic if there is a bijective function f : V (G) ∪ E(G) −→ {...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪...
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...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
The -product that is referred in the title was introduced in 2008 as a generalization of the Kroneck...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
Let G be a graph of order p and size q with loops allowed. A bijective function f:V(G)∪E(G)→{i}p+qi=...
A graph G of order p and size q is edge-magic if there is a bijective function f : V (G) ∪ E(G) −→ {...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪...
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...
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to o...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-...
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...