Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"orientable distance magic"”.

  1. Distance magic-type and distance antimagic-type labelings of graphs

    Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection f from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the same. The weight of a vertex x is defined as …

    mtu Repository record for Distance magic-type and distance antimagic-type labelings of graphs (opens in a new tab)