Super edge-antimagic labeling of a cycle with a chord m. baca


Abstract:

An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edges onto 1,2,..., |V(G)| +|E(G)|so that the edge-weights w(uv) = g(u) + g(v) + g(uv), uv ∈ E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existence of super (a, (i)-edge-antimagic. total labelings of graphs derived from cycles by adding one chord.

Año de publicación:

2006

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Article

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Teoría de grafos
    • Optimización matemática

    Áreas temáticas:

      Contribuidores: