summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the v...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different con...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
summary:Necessary and sufficient conditions for a graph $G$ that its power $G^i$, $i\geq2$, is a mag...
AbstractA graph is magic if the edges are labeled with distinct nonnegative real numbers such that t...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the v...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different con...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
summary:Necessary and sufficient conditions for a graph $G$ that its power $G^i$, $i\geq2$, is a mag...
AbstractA graph is magic if the edges are labeled with distinct nonnegative real numbers such that t...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the v...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
DOI
Add to ORKG