Add to ORKGA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V (G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
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...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
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...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
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 ve...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
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...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
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...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
summary:A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
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 ve...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Magic rectangles are a classical generalization of the well-known magic squares, and they are relate...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different con...