Complete solutions on local antimagic chromatic number of three families of disconnected graphs
An edge labeling of a graph G = (V, E) is said to be local antimagic if it is a bijection f : E -> {1,. ..,|E|} such that for any pair of adjacent vertices x and y, f+(x) =6 f+(y), where the induced vertex label f+(x) = E f (e), with e ranging over all the edges incident to x. The local antimagic...
| Published in: | COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION |
|---|---|
| Main Authors: | , , , |
| Format: | Article; Early Access |
| Language: | English |
| Published: |
AZARBAIJAN SHAHID MADANI UNIV
2024
|
| Subjects: | |
| Online Access: | https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001186635800001 |