Some results on (a,d)-distance antimagic labeling

• Patel, S. K. ^[2] ; Vasava, Jayesh ^[1]
  1. [1] Gujarat University

     Gujarat University

     India

     
  2. [2] Government Engineering College.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 39, Nº. 2, 2020, págs. 361-381
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Let G = (V,E) be a graph of order N and f : V → {1, 2,...,N} be a bijection. For every vertex v of graph G, we define its weight w(v) as the sum ∑u∈N(v) f(u), where N(v) denotes the open neighborhood of v. If the set of all vertex weights forms an arithmetic progression {a, a + d, a + 2d, . . . , a + (N − 1)d}, then f is called an (a, d)-distance antimagic labeling and the graph G is called (a, d)-distance antimagic graph. In this paper we prove the existence or non-existence of (a, d)- distance antimagic labeling of some well-known graphs.