We characterize finite graphs that admit a labelling of the edges by pairwise different positive (non-negative) integers in such a way that the sum of the labels of the edges incident with a vertex is independent of the particular vertex
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
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...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
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 called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
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...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
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...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
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 called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different e...
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...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
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...
DOI
Add to ORKG