---

＜電子ブック＞
Magic Graphs / by W.D. Wallis

版	1st ed. 2001.
出版者	(Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser)
出版年	2001
大きさ	XIV, 146 p : online resource
著者標目	*Wallis, W.D author SpringerLink (Online service)
件　名	LCSH:Discrete mathematics LCSH:Computer science—Mathematics LCSH:Mathematics FREE:Discrete Mathematics FREE:Discrete Mathematics in Computer Science FREE:Applications of Mathematics
一般注記	1 Preliminaries -- 1.1 Magic -- 1.2 Graphs -- 1.3 Labelings -- 1.4 Magic labeling -- 1.5 Some applications of magic labelings -- 2 Edge-Magic Total Labelings -- 2.1 Basic ideas -- 2.2 Graphs with no edge-magic total labeling -- 2.3 Cliques and complete graphs -- 2.4 Cycles -- 2.5 Complete bipartite graphs -- 2.6 Wheels -- 2.7 Trees -- 2.8 Disconnected graphs -- 2.9 Strong edge-magic total labelings -- 2.10 Edge-magic injections -- 3 Vertex-Magic Total Labelings -- 3.1 Basic ideas -- 3.2 Regular graphs -- 3.3 Cycles and paths -- 3.4 Vertex-magic total labelings of wheels -- 3.5 Vertex-magic total labelings of complete bipartite graphs -- 3.6 Graphs with vertices of degree one -- 3.7 The complete graphs -- 3.8 Disconnected graphs -- 3.9 Vertex-magic injections -- 4 Totally Magic Labelings -- 4.1 Basic ideas -- 4.2 Isolates and stars -- 4.3 Forbidden configurations -- 4.4 Unions of triangles -- 4.5 Small graphs -- 4.6 Totally magic injections -- Notes on the Research Problems -- References -- Answers to Selected Exercises 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 HTTP:URL=https://doi.org/10.1007/978-1-4612-0123-6

 類似資料