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: | Shiu W.-C.; Lau G.-C.; Zhang R. |
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 |
Similar Items
-
On Bridge Graphs with Local Antimagic Chromatic Number 3
by: Shiu, et al.
Published: (2025) -
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
by: 2-s2.0-85099496674
Published: (2021) -
Affirmative Solutions on Local Antimagic Chromatic Number
by: 2-s2.0-85086567268
Published: (2020) -
ON LOCAL ANTIMAGIC TOTAL LABELING OF COMPLETE GRAPHS AMALGAMATION
by: 2-s2.0-85164321688
Published: (2023) -
EVERY GRAPH IS LOCAL ANTIMAGIC TOTAL AND ITS APPLICATIONS
by: 2-s2.0-85170201438
Published: (2023)