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]
@article{PandaP22,
title = {Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs},
author = {B. S. Panda 0001 and Priyamvada},
year = {2022},
doi = {10.1016/j.tcs.2022.01.003},
url = {https://doi.org/10.1016/j.tcs.2022.01.003},
researchr = {https://researchr.org/publication/PandaP22},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {906},
pages = {32-51},
}