Sparse anti-magic squares and vertex-magic labelings of bipartite graphs | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Author final version	191 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/803634

Title: Sparse anti-magic squares and vertex-magic labelings of bipartite graphs
Author/Creator: Gray, I. D.; MacDougall, James A.
Description: A sparse anti-magic square is an n X n array whose non-zero entries are the consecutive integers 1,...,m for some m ≤ n² and whose row-sums and column-sums form a set of consecutive integers: We derive some basic properties of these arrays and provide constructions for several infinite families of them. Our main interest in these arrays is their application to constructing vertex-magic labelings for bipartite graphs.
Relation: Discrete Mathematics Vol. 306, Issue 22, p. 2878-2892
Publisher Link: http://dx.doi.org/10.1016/j.disc.2006.04.032
Date: 2006
Publisher: Elsevier
Keyword(s): anti-magic square; magic labeling
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/803634
Identifier: ISSN:0012-365X
Language: eng

45 Visitors

91 Hits

NOVA. The University of Newcastle's Digital Repository