On Bridge Graphs with Local Antimagic Chromatic Number 3
Let (Formula presented.) be a connected graph. A bijection (Formula presented.) is called a local antimagic labeling if, for any two adjacent vertices x and y, (Formula presented.), where (Formula presented.), and (Formula presented.) is the set of edges incident to x. Thus, a local antimagic labeli...
| Published in: | Mathematics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Multidisciplinary Digital Publishing Institute (MDPI)
2025
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85214485816&doi=10.3390%2fmath13010016&partnerID=40&md5=8304b63ceaca798068c159fed6691c9e |