We show how to label graphs we call assemblages which are constructed by putting together one or more kinds of subunits into a single graph.
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection from the union of the vertex set and the edge set to the ...
Vertex-magic labeling of regular graphs: Disjoint unions and ...
dl.acm.org › abs › j.dam.2011.11.025
Abstract. We establish the existence of vertex-magic total labelings (VMTLs) for several infinite classes of regular graphs. The main method of construction is ...
In this paper, the new concept of proper colourings in vertex magic and anti-magic graphs has been introduced. A bijection mapping that assigns natural number ...
Vertex-magic labeling of regular graphs: Disjoint unions and assemblages. We establish the existence of vertex-magic total labelings (VMTLs) for several ...
A vertex-ma gic total labeling is an assignment of the integers 1, 2, . . . , p + q to the vertices and the edges of G, so that at each vertex, the vertex...
Vertex-magic labeling of regular graphs: Disjoint unions and assemblages. Discrete Applied Mathematics, Vol. 160, No. 7-8 | 1 May 2012. The power of digraph ...
People also ask
What is the vertex magic total labeling of graphs?
What is disjoint union of two graphs?
What are the different types of Labelling in graph theory?
What is a graph in which each vertex has the same number of neighbors?
Vertex-magic labeling of regular graphs: disjoint unions and assemblages. - Gray, I. D., MacDougall, J. A.. Creator: Gray, I. D. , MacDougall, J. A.; Resource ...
Jun 20, 2015 · A vertex magic total labelling is a bijection from the union of the vertex set and the edge set to the consecutive integers 1, 2,. 3, . . . , p ...
A vertex-magic total labeling is an assignment of the integers 1 , 2 , … , p + q to the vertices and the edges of G, so that at each vertex, the vertex label ...