On Local Antimagic Chromatic Number of Graphs with Cut-vertices
An edge labeling of a connected 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) ≠ f+ (y), where the induced vertex label f+ (x) =∑ f(e), with e ranging over all the edges incident to x. The local antim...
| Published in: | Iranian Journal of Mathematical Sciences and Informatics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Iranian Academic Center for Education, Culture and Research
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85196111343&doi=10.61186%2fijmsi.19.1.1&partnerID=40&md5=110d7bea1b46b9cbe09213324c81f120 |