Super Vertex-magic Total Labelings of Graphs

MacDougall, James A. and Miller, Mirka and Sugeng, K. A. (2004) Super Vertex-magic Total Labelings of Graphs. Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms . pp. 222-229.

PDF - Accepted Version
Download (147Kb) | Preview


    Let $G$ be a finite simple graph with $v$ vertices and $e$ edges. A vertex-magic total labeling is a bijection $\lambda$ from $V (G) \cup E(G)$ to the consecutive integers 1, 2, . . . , $v+e$ with the property that for every $x \in V (G)$, $\lambda(x) + \Sigma_y\in N(x)\lambda(xy) = k$ for some constant $k$. Such a labeling is {\em super} if $\lambda(V (G)) = {1, . . . , v}$. We study some of the basic properties of such labelings, find some families of graphs that admit super vertex-magic labelings and show that some other families of graphs do not.

    Item Type: Article
    Subjects: 00-xx General
    Faculty: UNSPECIFIED
    Depositing User: Stephanie
    Date Deposited: 13 Dec 2010 11:53
    Last Modified: 13 Dec 2010 11:53

    Actions (login required)

    View Item