In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.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 Catalan Research Council under grant 2009SGR1387
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph G is called edge - magic if there is a bijec-tive function f : V (G)∪E(G) → {1, 2, . . . , |...
DE LA TESISSi un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf su...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
A graph G of order p and size q is edge-magic if there is a bijective function f : V (G) ∪ E(G) −→ {...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic 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...
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 graph $G$ is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left...
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 called super edge-magic if there exists a bijective function f fr...
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges...
Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such...
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph G is called edge - magic if there is a bijec-tive function f : V (G)∪E(G) → {1, 2, . . . , |...
DE LA TESISSi un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf su...
Graph labelings has experimented a fast development during the last four decades. Two books dedicate...
A graph G of order p and size q is edge-magic if there is a bijective function f : V (G) ∪ E(G) −→ {...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic 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...
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 graph $G$ is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left...
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 called super edge-magic if there exists a bijective function f fr...
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges...
Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such...
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph G is called edge - magic if there is a bijec-tive function f : V (G)∪E(G) → {1, 2, . . . , |...
DE LA TESISSi un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf su...