Abstract

The least k such that a given digraph D=(V,A) can be arc-labeled with integers in the interval [1,k] so that the sum of values in-coming to x is distinct from the sum of values out-going from y for every arc (x,y)∈A, is denoted by χ̄Łe(D). This corresponds to one of possible directed versions of the well-known 1-2-3 Conjecture. Unlike in the case of other possibilities, we show that χ̄Łe(D) is unbounded in the family of digraphs for which this parameter is well defined. However, if the family is restricted by excluding the digraphs with so-called lonely arcs, we prove that χ̄Łe(D)≤4, and we conjecture that χ̄Łe(D)≤3 should hold.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.