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) -
Can Digitalization Bridge the Gap? Exploring Human Development and Inequality in Gauteng Province, South Africa?
by: de Bruyn C.; Musa K.; Castanho R.A.
Published: (2024) -
MTP validation analysis of scour formulae in an integral abutment bridge
by: Ghazvinei P.T.; Hassanpour Darvishi H.; Ariffin J.; Musavi Jahromi S.H.; Aghamohammadi N.; Amini A.
Published: (2017) -
Integrating and retrieving learning analytics data from heterogeneous platforms using ontology alignment: Graph-based approach
by: Musa, et al.
Published: (2025) -
Multi-level parallel scheduling of dependent-tasks using graph-partitioning and hybrid approaches over edge-cloud
by: Kaur M.; Kadam S.; Hannoon N.
Published: (2022)