The inapproximability for the $(0,1)$-additive number
An <i>additive labeling</i> of a graph $G$ is a function $\ell :V(G) \rightarrow \mathbb{N}$, such that for every two adjacent vertices $v$ and $u$ of $G$, $\Sigma_{w \sim v} \ell (w) \neq \Sigma_{w \sim u} \ell (w)$ ($x \sim y$ means that $x$ is joined to $y$). The additive number of $G...
Main Authors: | Arash Ahadi, Ali Dehghan |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-06-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2145/pdf |
Similar Items
-
Approximation and inapproximability results on balanced connected partitions of graphs
by: Frédéric Chataigner, et al.
Published: (2007-01-01) -
Connectedness of number theoretical tilings
by: Shigeki Akiyama, et al.
Published: (2005-01-01) -
The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01) -
The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01) -
The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)