Vertex-Magic Total Labelings of Graphs

MacDougall, James A. and Miller, Mirka and Wallis, W. D. (2002) Vertex-Magic Total Labelings of Graphs. Utilitas Mathematics, 61 . pp. 3-21.

PDF - Accepted Version
Download (181Kb) | Preview


    A vertex-magic total labeling of a graph with $v$ vertices and $e$ edges is defined as a one-to-one map taking the vertices and edges onto the integers $1, 2, . . . , v+e$ with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. Properties of these labelings are studied. It is shown how to construct labelings for several families of graphs, including cycles, paths, complete graphs of odd order and the complete bipartite graph $K_n,n$. It is also shown that labelings are impossible for some other classes of graphs.

    Item Type: Article
    Subjects: 00-xx General
    Faculty: UNSPECIFIED
    Depositing User: Stephanie
    Date Deposited: 28 Sep 2012 12:05
    Last Modified: 28 Sep 2012 12:05

    Actions (login required)

    View Item