A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1,2,...,v + e. Such a labeling is vertex magic if the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex, and edge magic if the sum of an edge label and the labels of the endpoints of the edge is constant. In this paper we examine graphs possessing a labeling that is simultaneously vertex magic and edge magic. Such graphs appear to be rare. © 2002 Elsevier Science B.V. All rights reserved
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the v...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
A totally magic labeling of a graph with v vertices and e edges is a one-to-one map taking the verti...
In this paper, we will study magic labelings. Magic labelings were first introduced by Sedláček in 1...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
To date the study of graph labellings has focused on nding classes of graphs which admit a particula...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the v...
A vertex magic labelling on a graph with v vertices and e edges is a one-to-one map taking the verti...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for exampl...
In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. T...
A totally magic labeling of a graph with v vertices and e edges is a one-to-one map taking the verti...
In this paper, we will study magic labelings. Magic labelings were first introduced by Sedláček in 1...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
To date the study of graph labellings has focused on nding classes of graphs which admit a particula...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...