Algorithmic complexity of proper labeling problems

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 g...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Dehghan, Ali, Mohammad-Reza, Sadeghi, Ahadi, Arash
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 23.01.2017
Subjects
Algorithms
Apexes
Coloring
Complexity
Computer Science - Discrete Mathematics
Graph theory
Integers
Labeling
Polynomials
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.1701.06669

Cover

More Information
Summary: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 \( \mathbf{NP} \)-completeness results for them.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1701.06669