Distance antimagic labeling of join and corona of two graphs
Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices . If the graph admits such a labeling, then is said to be a distance antimagic...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.04.003 |
| _version_ | 1819059899384987648 |
|---|---|
| author | A.K. Handa Aloysius Godinho T. Singh S. Arumugam |
| author_facet | A.K. Handa Aloysius Godinho T. Singh S. Arumugam |
| author_sort | A.K. Handa |
| collection | DOAJ |
| description | Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices . If the graph admits such a labeling, then is said to be a distance antimagic graph. In this paper we investigate the existence of distance antimagic labelings of and . |
| first_indexed | 2024-12-21T14:18:26Z |
| format | Article |
| id | doaj.art-c40eafa2e35944b09e0294648de40a98 |
| institution | Directory Open Access Journal |
| issn | 0972-8600 |
| language | English |
| last_indexed | 2024-12-21T14:18:26Z |
| publishDate | 2017-08-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-c40eafa2e35944b09e0294648de40a982022-12-21T19:00:52ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002017-08-0114217217710.1016/j.akcej.2017.04.00312092622Distance antimagic labeling of join and corona of two graphsA.K. Handa0Aloysius Godinho1T. Singh2S. Arumugam3Department of Mathematics, Birla Institute of Technology and Science Pilani K K Birla Goa Campus, NH-17BDepartment of Mathematics, Birla Institute of Technology and Science Pilani K K Birla Goa Campus, NH-17BDepartment of Mathematics, Birla Institute of Technology and Science Pilani K K Birla Goa Campus, NH-17BNational Centre for Advanced Research in Discrete Mathematics, Kalasalingam University, AnandnagarLet be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices . If the graph admits such a labeling, then is said to be a distance antimagic graph. In this paper we investigate the existence of distance antimagic labelings of and .http://dx.doi.org/10.1016/j.akcej.2017.04.003distance antimagic labelingarbitrarily distance antimagic labelingdistance magic labeling |
| spellingShingle | A.K. Handa Aloysius Godinho T. Singh S. Arumugam Distance antimagic labeling of join and corona of two graphs AKCE International Journal of Graphs and Combinatorics distance antimagic labeling arbitrarily distance antimagic labeling distance magic labeling |
| title | Distance antimagic labeling of join and corona of two graphs |
| title_full | Distance antimagic labeling of join and corona of two graphs |
| title_fullStr | Distance antimagic labeling of join and corona of two graphs |
| title_full_unstemmed | Distance antimagic labeling of join and corona of two graphs |
| title_short | Distance antimagic labeling of join and corona of two graphs |
| title_sort | distance antimagic labeling of join and corona of two graphs |
| topic | distance antimagic labeling arbitrarily distance antimagic labeling distance magic labeling |
| url | http://dx.doi.org/10.1016/j.akcej.2017.04.003 |
| work_keys_str_mv | AT akhanda distanceantimagiclabelingofjoinandcoronaoftwographs AT aloysiusgodinho distanceantimagiclabelingofjoinandcoronaoftwographs AT tsingh distanceantimagiclabelingofjoinandcoronaoftwographs AT sarumugam distanceantimagiclabelingofjoinandcoronaoftwographs |