summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different con...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
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...
AbstractA graph is called supermagic if it admits a labelling of the edges by pairwise different con...
A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually pos...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different con...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
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...
AbstractA graph is called supermagic if it admits a labelling of the edges by pairwise different con...
A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually pos...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
DOI
Add to ORKG