Local Distance Antimagic Labeling of Neighborhood Balanced Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912373127774208 |
|---|---|
| author | Almeida, Maurice Genevieva |
| author_facet | Almeida, Maurice Genevieva |
| contents | Let G = (V, E) be a graph of order n without isolated vertices. A bijection f from vertex set of G to the set of integers from 1 to n is called a local distance antimagic labeling, if w(u) is not equal to w(v) for every edge uv of G, where w(u) is sum of labels of vertices adjacent to u. The local distance antimagic chromatic number xld(G) is defined to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. In this article, we study the local distance antimagic labeling of neighborhood balanced colored graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_08134 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Local Distance Antimagic Labeling of Neighborhood Balanced Graphs Almeida, Maurice Genevieva Combinatorics 05C 78 Let G = (V, E) be a graph of order n without isolated vertices. A bijection f from vertex set of G to the set of integers from 1 to n is called a local distance antimagic labeling, if w(u) is not equal to w(v) for every edge uv of G, where w(u) is sum of labels of vertices adjacent to u. The local distance antimagic chromatic number xld(G) is defined to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. In this article, we study the local distance antimagic labeling of neighborhood balanced colored graphs. |
| title | Local Distance Antimagic Labeling of Neighborhood Balanced Graphs |
| topic | Combinatorics 05C 78 |
| url | https://arxiv.org/abs/2505.08134 |