Vertex-magic labeling of regular graphs: disjoint unions and assemblages

Title: Vertex-magic labeling of regular graphs: disjoint unions and assemblages
Creator: Gray, I. D.; MacDougall, J. A.
Relation: Discrete Applied Mathematics Vol. 160, Issue 7-8, p. 1114-1125
Publisher Link: http://dx.doi.org/10.1016/j.dam.2011.11.025
Publisher: Elsevier BV, North-Holland
Resource Type: journal article
Date: 2012
Description: We establish the existence of vertex-magic total labelings (VMTLs) for several infinite classes of regular graphs. The main method of construction is to assemble a number of appropriately labeled copies of one graph into a single graph with a VMTL. This method enables us for example to begin with any even-regular graph and from it construct a cubic graph possessing a VMTL. An important feature of the construction is that it produces strong VMTLs for many even order regular graphs. In addition the method provides another proof that for any odd-regular graph G possessing a VMTL, the disconnected graph tG has a VMTL for all t≥1. The construction also extends to certain families of non-regular graphs.
Subject: magic labeling; graphs; VMTL; vertex magic
Identifier: http://hdl.handle.net/1959.13/1309433
Identifier: uon:21870
Identifier: ISSN:0166-218X
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format