Jakub Przybylo ; Mariusz WoźniaK - On a 1, 2 Conjecture

dmtcs:491 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 1 - https://doi.org/10.46298/dmtcs.491
On a 1, 2 Conjecture

Authors: Jakub Przybylo ; Mariusz WoźniaK

    Let us assign positive integers to the edges and vertices of a simple graph G. As a result we obtain a vertex-colouring of G with integers, where a vertex colour is simply a sum of the weight assigned to the vertex itself and the weights of its incident edges. Can we obtain a proper colouring using only weights 1 and 2 for an arbitrary G? We give a positive answer when G is a 3-colourable, complete or 4-regular graph. We also show that it is enough to C use weights from 1 to 11, as well as from 1 to 11 [chi(G)/2] + 1, for an arbitrary graph G.


    Volume: Vol. 12 no. 1
    Section: Graph and Algorithms
    Published on: January 1, 2010
    Imported on: March 26, 2015
    Keywords: neighbour-distinguishing total-weighting,irregularity strength,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 235 times.
    This article's PDF has been downloaded 335 times.