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 4 of 4 for “"magic graphs"”.
-
A SURVEY OF DISTANCE MAGIC GRAPHS
In this report, we survey results on distance magic graphs and some closely related graphs. A distance magic labeling of a graph G with magic constant k is a bijection l from the vertex set to {1, 2, . . . , n}, such that for every vertex x Σ l(y) = k,y∈NG(x) where NG(x) is the set of vertices of G …
-
Zero-sum magic graphs and their null sets
… vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges incident to a vertex, is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The …
-
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 …
-
Magic labelings of directed graphs
… arcs with head at x. The graph is additive arc magic if all additive arc-weights are equal, and is additive directed vertex magic if all vertex-weights are equal. We provide a complete characterization of all graphs which permit an additive arc magic labeling. A complete characterization of all …