Magic Sigma Coloring of a Graph
A sigma coloring of a non-trivial connected graph $G$ is a coloring $c:V(G)\rightarrow\mathbb{N}$ such that $\sigma(u)\ne\sigma(v)$ for every two adjacent vertices $u,v\in V(G)$, where $\sigma(v)$ is the sum of the colors of the vertices in the open neighborhood $N(v)$ of $v\in V(G)$. The minimum nu...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2021-09-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/publications/csjm/issues/v29-n2/13344/ |