All regular graphs of small odd order are vertex-magic

Title: All regular graphs of small odd order are vertex-magic
Creator: Kimberley, Jason S.; MacDougall, James A.
Relation: Australasian Journal of Combinatorics Vol. 51, p. 175-199
Relation: http://ajc.maths.uq.edu.au/?page=get_volumes&volume=51
Publisher: Centre for Discrete Mathematics & Computing
Resource Type: journal article
Date: 2011
Description: This paper deals with vertex-magic total labellings of graphs. Earlier work by many authors has shown many infinite families of graphs to admit such labelings. The fact that many of these graphs are regular led MacDougall to conjecture that all non-trivial regular graphs are vertex-magic. Previously Gray and MacDougall showed that all odd-order r-regular graphs (r ≥ 2) of order up to v = 19 are vertex-magic. In this paper, we report on computations that extend this range, to show that all odd-order r-regular graphs (r ≥ 2) of order up to v = 29 are vertex-magic.
Subject: vertex-magic total labellings; graphs; regular graphs; odd-order
Identifier: http://hdl.handle.net/1959.13/920376
Identifier: uon:9139
Identifier: ISSN:1034-4942
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT02	Publisher version (open access)	214 KB	Adobe Acrobat PDF	View Details Download