Local distance antimagic cromatic number of join product of graphs with cycles or paths
Let G be a graph of order p without isolated vertices. A bijection f: V → {1, 2, 3, …, p} is called a local distance antimagic labeling, if (Formula Presented) for every edge uv of G, where (Formula Presented). The local distance antimagic chromatic number χlda(G) is defined to be the minimum number...
| Published in: | Hacettepe Journal of Mathematics and Statistics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Hacettepe University
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85197923286&doi=10.15672%2fhujms.1266085&partnerID=40&md5=0423f375a543c190654a42f2a82d7c42 |