Annina Saluz

  • Citations Per Year
Learn More
A graph G = (V,E) is called antimagic if there exists a bijection from the set of edges to the integers 1, . . . , |E| such that all |V | vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. According to Ringel's Conjecture in [4], every simple connected graph, other than K2, is antimagic. In(More)
  • 1