Proper Magic Sigma Coloring of Specific Graphs
A coloring $\varphi: V(G)\rightarrow \{1,2,\ldots,k \}$ is called a magic sigma coloring of $G$ if the sum of colors of all the vertices in the neighborhood of each vertex of $G$ is the same. A graph that admits such a coloring is said to be magic sigma colorable. The minimum number $k$ required...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2025-04-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | https://www.math.md/files/csjm/v33-n1/v33-n1-(pp141-156).pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|