European Mathematical Society - 05c78, 68r10, 05c30.
https://euro-math-soc.eu/msc-full/05c78-68r10-05c30
enMAGIC GRAPHS
https://euro-math-soc.eu/review/magic-graphs
<div class="field field-name-field-review-review field-type-text-with-summary field-label-hidden"><div class="field-items"><div class="field-item even"><div class="tex2jax"><p>The book begins with a survey of the main topics. Magic properties are introduced by a discussion of magic squares, also the related Latin squares and on Latin rectangles, and the basics of graph theory.</p>
<p>The book Magic Graphs, is self-contained, good, admirably clear, and a stimulating and very well written. This concise text-book is the only book of its kind in the area of magic graphs/labeling, it contains numerous exercises, and their solutions, and includes updates on new research in the field. </p>
<p>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—and whose range was a set of positive integers. Various restrictions can be placed on the mapping.</p>
<p>The introductory chapter covers briefly the basics of graph theory and introduces various kinds of magic labeling of graphs. The main three chapters that follow are devoted to the three main types of magic labeling: edge magic, vertex-magic, and totally magic labeling, respectively. Each main topic is treated in depth. Not many mathematical prerequisites are needed to read this book although the reader should have some mathematical maturity. The mathematical material is sufficiently closed.</p>
<p>The aim of the present book is to describe the main concepts of magic graphs and labeling, together with full proofs that would be both accessible to beginners and useful for graduate and advanced undergraduate in mathematics or computer science, or recreational mathematical, and as reference for the researcher. The chapter five, added to the second edition, is devoted to rapidly developing areas of magic graphs, as newly magic type labeling of digraphs. </p>
<p>It goes from the basics to the frontiers of research in magic labeling of digraphs, with newly ideas emergent, in mathematics or computer science. For the reader is suitable solving some of the many exercises and research problems. ¡Good experience for share seriously the problems!</p>
<p>I feel sure that it will be of great use both to students of graph theory, magic graphs, Latin squares and Latin rectangles, design of experiments, graceful graphs, and mathematics, in general, and captivate to students, instructors, puzzle devotees, and to those intervening in recreational mathematics.</p>
<p>The book contains preface, table of contents, list de figures (pp. i-xvi), and five chapters, comments on the research problems, references, answers to selected exercises, and an index, in 186 pp. </p>
<p>The first chapter, preliminaries, (pp. 1-14), introduces the basic, definitions and notions, devoted to present the main topics in the subject. The book begins with a survey of main items. Magic properties with a discussion of magic squares, related Latin squares and on Latin rectangles are presented. The basics of graph theory are covered. A labeling (or valuation) of a graph is a map that carries graph elements to numbers. The most common choices of domain are the set of all vertices and edges (named total-labeling), the vertex-set alone (vertex-labeling), or the edge-set alone (edge-labeling). </p>
<p>Then define graph labeling, in general and magic labeling, in particular. In many cases, it is interesting to consider the sum of all labels associated with a graph label. It is conceivable that the same labeling could be both vertex-magic and edge-magic for a given graph, in this case the labeling, and the graph are called totally magic. There are also a number of interesting types of magic labeling of digraphs. The chapter also includes some applications of magic labeling to efficient addressing systems and to ruler models.</p>
<p>This preliminary chapter considered three theorems, and one lemma, and one corollary. Also ten exercises, very quite easy. The proofs of theorems and lemmas are given, and also the majority of exercises are solved with their respective solutions.</p>
<p>In the chapter two, (pp. 15-70), on define an edge-magic total labeling on a graph G as a one-to-one map λ form V(G) U E(G) onto the integers 1,2, …, v+e, where v=card(V(G)) and e=card(E(G)), with the property that, given any edge xy, λ(x) + λ(xy) + λ(y) = k, for some constant k, that is, wt(xy) =k for any choice of edge xy. Then k is called the magic sum of G. </p>
<p>Any graph with an edge-magic total labeling will be called edge magic. Examples of edge magic total labeling are given.</p>
<p>The remainder is full dedicated to Edge-Magic Total Labeling: Basic ideas, definitions, some elementary counting, and duality; then Graphs with no edge magic total labeling, main theorem, forest, regular graphs; Cliques and complete graphs, the Sidon sequences and labeling, complete graphs, all edge-magic total labeling of complete graphs, complete and split sub-graphs and graphs; Cycles, small and generalizations; Complete Bipartite Graphs, small cases and stars; Wheels, the constructions for n, distinct of ≡2 (mod.4), and n≡ 2 (mod.4); Trees; Disconnected Graphs, some easy cases, union of complete graphs, union of stars, tri-chromatic graphs; Super edge-magic total labeling; A cycle with a chord, odd and even cycles, and some general constructions; to end edge magic injections.</p>
<p>This chapter considered 37 theorems, and ten lemmas, and seven corollaries. For stimulating to reader and the beginner researcher on proposed 24 exercises, and 21 research problems. The proofs of theorems and lemmas are given, and also the majority of exercises are solved with their respective solutions. Respect the research problems are given hints for their statement that are solved in the Notes on Research Problems, pages 159 to 162, because the most requires very little work. </p>
<p>In the chapter 3, (pp.71-109), on define a vertex-magic total labeling on a graph G as a one-to-one map λ form V(G) U E(G) onto the integers {1,2, …, v+e}, where v=card(V(G)) and e=card(E(G)), if there is a constant h so that for every vertex x, λ(x) + ∑ λ(xy) = h, where the sum is over all vertices y adjacent to x. So the magic requirement is wt(x) =h for all x. The constant h is called the magic constant for λ. Again, a graph with a vertex-magic total labeling will be called vertex-magic. It is not hard to find examples of vertex-magic total labeling for some graphs. </p>
<p>The chapter is totally devoted to vertex-magic total labeling, and analyze basic ideas, definitions and basic counting; the case of regular graphs, cycles and paths; the interesting case of vertex-magic total labeling of wheels and its generalizations, because the large wheels cannot be labeled, and the small wheels can have many labeling; the vertex-magic total labeling of complete bipartite graphs, construction for Km,n, the spectrum, joins, unions of stars; the vertex-magic total labeling of complete tripartite graphs; graphs with vertices of degree one; complete graphs; disconnected graphs, multiples of regular graphs; super vertex-magic total labeling, and vertex-magic injections.</p>
<p>This chapter considered 30 theorems, and two lemmas, and eight corollaries. Fifteen exercises, and five research problems, are proposed. The proofs of theorems and lemmas are given, and also the majority of exercises are solved with their respective solutions. Respect the research problems are given hints for their statement. </p>
<p>In this chapter 4, investigate the question: for a graph G does there exist, a total labeling λ, that is, both edge-magic and vertex-magic? λ is called a totally magic labeling and G is a totally graph. The constants h and k are the magic constant and magic sum, respectively. Not require that h=k. Because the totally magic graphs are very rare, is adequate, to study totally magic injections. If a graph posses such a mapping, is called total magic injections (TMI) graph. </p>
<p>The chapter is completely devoted to totally magic labeling (pp. 111-134), and study basic ideas, definitions and examples. Then isolates and stars; forbidden configurations; unions of triangles; small graphs; totally magic injections; totally magic equation matrix, and the survivors on seven vertices. </p>
<p>This chapter considered 18 theorems, and four lemmas, and eleven exercises. The proofs of theorems and lemmas are given, and also the majority of exercises are solved with their respective solutions. Moreover, eight exercises and five interesting research problems are proposed.</p>
<p>The chapter 5, (pp. 135-157), new in this second edition, respect to the original book of Wallis, in this case, in collaboration with Alison Marr, deals with magic type labeling of digraphs. Early labeling results were all on undirected graphs. However, in mid-1980s, in the literature appeared the graceful labeling on directed graphs, in general, this is very important due to a number of interesting results that have applications and are related to the problems of decomposing graphs into trees. </p>
<p>A magic labeling of a digraph D is a one-to-one map λ from V(D)UE(D) onto the set of integers {1,2,…,v+e}, in which all the sums mA= λ (x) + ∑x→y λ(x,y), and all sums mB= λ (x) + ∑z→x λ(z,y), are constant, independent of the choice of x. A digraph with a magic labeling is a magic digraph.</p>
<p>The chapter is completely devoted to magic type labeling of digraphs, and study magic labeling, with definitions, basic counting, small examples, complete digraphs, double cycles, and magic digraphs with two magic constants; locally magic labeling with digraphs such as no locally magic labeling, cycles, wheels, complete graphs, and complete bipartite digraphs; vertex-magic edge labeling; arc-magic labeling with definitions, paths and cycles, labeling for arc-magic digraphs, and to end, different items on in/out magic total labeling, basic ideas, small digraphs, forbidden configurations, and regular graphs. </p>
<p>This chapter considered 25 theorems, and two lemmas, and ten exercises. The proofs of theorems and lemmas are given, and also the majority of exercises are solved with their respective solutions. Moreover, six interesting research problems are proposed.</p>
<p>Notes on Research Problems, (pp. 159-162). Different kinds on research problems are mentioned throughout the text. The most required very little work. An brief comment is included in the volume, related to research problems on the three main topics (about edge-magic labeling, 21 stated problems; on vertex magic labeling, 5 posed problems; on totally magic labeling, with five research problems) and the other topic, added in this second edition, on magic type labeling of digraphs, on considered six proposed problems. The last three problems, in this chapter about notes on research problems, all ask for more general results for some classes of digraphs or to find more infinite families of digraph with the given property.</p>
<p>References, (pp. 163-169). They are an extensive bibliography, 99 up-date references.</p>
<p>Answers to Selected exercises, (pp. 171-182). The exercises are designed to aid understanding. Some are quite easy, a few are quite difficult, and the others for works particular graph or labeling. There are worked solutions, to the majority of the exercises.</p>
<p>Index (pp. 183-186)</p>
<p>In this second edition includes: a new chapter on magic labeling of directed graphs, applications of theorems from graph theory and interesting counting arguments, a good collection of new research problems and exercises covering a range of difficulties, and a fully updated bibliography and index. The book is a beautiful collection of recent results on the topic of magic labeling. </p>
<p>Definitely the book is high recommended and is of much interest. This book is a good guide for graduate students beginning research in graph labeling. They can see how new mathematics comes into existence. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher. I feel sure that it will be of great use both to students and researchers.</p>
</div></div></div></div><div class="field field-name-field-review-reviewer field-type-text field-label-inline clearfix"><div class="field-label">Reviewer: </div><div class="field-items"><div class="field-item even">Francisco José Cano Sevilla. </div></div></div><div class="field field-name-field-review-legacy-affiliation field-type-text field-label-inline clearfix"><div class="field-label">Affiliation: </div><div class="field-items"><div class="field-item even">Profesor Universidad Complutense</div></div></div><div class="field field-name-field-review-desc field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even"><div class="tex2jax"><p>The book begins with a survey of the main topics. Magic properties are introduced by a discussion of magic squares, also the related Latin squares and on Latin rectangles, and the basics of graph theory.</p>
<p>This concise, self-contained text-book is the only book of its kind in the area of magic graphs/labeling, it contains numerous exercises, and their solutions, and includes updates on new research in the field. 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—and whose range was a set of positive integers. Various restrictions can be placed on the mapping.</p>
<p>Recently there has been a resurgence of interest to magic labeling due to a number of results that have applications to the problem of decomposing graphs into trees.</p>
<p>In this second edition includes: a new chapter on magic labeling of directed graphs, applications of theorems from graph theory and interesting counting arguments, this is why a new edition seemed appropriate, a good collection of new research problems and exercises covering a range of difficulties, and a fully updated bibliography and index. The book is a beautiful collection of recent results on the topic of magic labeling. </p>
<p>Some knowledge of groups and fields is assumed in the preliminary chapter, in the discussion of magic squares and Latin squares, and the basics of graph theory. Subsequent chapters explore the three main types of magic labeling—edge-magic, vertex-magic, and totally magic—in turn. Finally, magic labeling of directed graphs are discussed.</p>
<p>This book is a good guide for graduate students beginning research in graph labeling. They can see how new mathematics comes into existence. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher.</p>
</div></div></div></div><span class="vocabulary field field-name-field-review-author field-type-taxonomy-term-reference field-label-inline clearfix"><h2 class="field-label">Author: </h2><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/author/alison-m-marr" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">alison m. marr</a></li><li class="vocabulary-links field-item odd"><a href="/author/wd-wallis" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">w.d. wallis</a></li></ul></span><span class="vocabulary field field-name-field-review-publisher field-type-taxonomy-term-reference field-label-inline clearfix"><h2 class="field-label">Publisher: </h2><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/publisher/springer-science-business-mediabirkh%C3%A4user-new-york2013-second-edition-xvi-186-p-34-illus" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">springer science + business media.birkhÄuser. new york.2013. second edition, xvi, 186 p. 34 illus., hardcover.</a></li></ul></span><div class="field field-name-field-review-pub field-type-number-integer field-label-inline clearfix"><div class="field-label">Published: </div><div class="field-items"><div class="field-item even">2013</div></div></div><div class="field field-name-field-review-isbn field-type-text field-label-inline clearfix"><div class="field-label">ISBN: </div><div class="field-items"><div class="field-item even">978-0-8176-8390-0; 978-0-8176-8391-7 (eBook); DOI 10.1007/978-0-8176-8391-7. </div></div></div><div class="field field-name-field-review-price field-type-text field-label-inline clearfix"><div class="field-label">Price: </div><div class="field-items"><div class="field-item even">From 41.84$ (eBook) to 51.95$ (Hardcover).</div></div></div><div class="field field-name-field-review-website field-type-text field-label-hidden"><div class="field-items"><div class="field-item even"><a href="/www.birkhauser-science.com" title="Link to web page">www.birkhauser-science.com</a></div></div></div><span class="vocabulary field field-name-field-review-msc field-type-taxonomy-term-reference field-label-hidden"><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/msc/05-combinatorics" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">05 Combinatorics</a></li></ul></span><span class="vocabulary field field-name-field-review-msc-full field-type-taxonomy-term-reference field-label-hidden"><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/msc-full/05c78-68r10-05c30" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">05c78, 68r10, 05c30.</a></li></ul></span>Mon, 22 Apr 2013 06:30:19 +0000Anonymous45503 at https://euro-math-soc.euhttps://euro-math-soc.eu/review/magic-graphs#comments