DocServer

Vertex-Magic Total Labelings of Complete Bipartite Graphs

MacDougall, James A. and Gray, I. D. and Wallis, W. D. and Simpson, R. J. (2003) Vertex-Magic Total Labelings of Complete Bipartite Graphs. ARS Combinatoria, 69 . pp. 117-127.

[img]
Preview
PDF - Accepted Version
Download (163Kb) | Preview

    Abstract

    A vertex-magic total labeling on a graph $G$ is a one-to-one map $\lambda$ from $V (G) \cup E(G)$ onto the integers 1, 2, . . . , $\mid V (G) \cup E(G)\mid$ with the property that, given any vertex $x, \lambda(x) +\Sigma_y\sim x \lambda(y) = k$ for some constant $k$. In this paper we completely determine which complete bipartite graphs have vertex-magic total labelings.

    Item Type: Article
    Subjects: 00-xx General
    Faculty: UNSPECIFIED
    Depositing User: Stephanie
    Date Deposited: 18 Nov 2010 16:05
    Last Modified: 18 Nov 2010 16:05
    URI: https://docserver.carma.newcastle.edu.au/id/eprint/809

    Actions (login required)

    View Item