Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs

B. S. Panda 0001, Priyamvada. Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. Theoretical Computer Science, 906:32-51, 2022. [doi]

Abstract

Abstract is missing.