Algorithmic complexity of proper labeling problems
Discrete Mathematics
2017-01-25 v1
Abstract
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and -completeness results for them.
Keywords
Cite
@article{arxiv.1701.06669,
title = {Algorithmic complexity of proper labeling problems},
author = {Ali Dehghan and Mohammad-Reza Sadeghi and Arash Ahadi},
journal= {arXiv preprint arXiv:1701.06669},
year = {2017}
}