Magic Graphs

Beschreibung

Magic labelings Magic squares are among the more popular mathematical recreations. Their origins are lost in antiquity; over the years, a number of generalizations have been proposed. In the early 1960s, Sedlacek asked whether "magic" ideas could be applied to graphs. Shortly afterward, Kotzig and Rosa formulated the study of graph label ings, or valuations as they were first called. A labeling is a mapping whose domain is some set of graph elements - the set of vertices, for example, or the set of all vertices and edges - whose range was a set of positive integers. Various restrictions can be placed on the mapping. The case that we shall find most interesting is where the domain is the set of all vertices and edges of the graph, and the range consists of positive integers from 1 up to the number of vertices and edges. No repetitions are allowed. In particular, one can ask whether the set of labels associated with any edge - the label on the edge itself, and those on its endpoints - always add up to the same sum. Kotzig and Rosa called such a labeling, and the graph possessing it, magic. To avoid confusion with the ideas of Sedlacek and the many possible variations, we would call it an edge-magic total labeling.

This concise, self-contained book is unique in its focus on the theory of magic graphs/labeling and its applications to a number of new areas, e.g., networks, the construction of rulers, and pulse codes. It may serve as a graduate text for a special topics seminar in mathematics or computer science, or as a professional text for the researcher. Some key features: concise exposition from basic topics in graph theory to current research; theorems from graph theory and interesting counting arguments.

Autor*in

W.D. Wallis

Themen in »Magic Graphs«

Applications of Mathematics Combinatorics Computer Graph Graph Theory computer science ksa verification vertices

Stimmen zu »Magic Graphs«

From the reviews:

Details

Link teilen