Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of \u201cmagic\u201d ideas have been applied to graphs. Recently there has been a resurgence of interest in \u201cmagic labelings\u201d due to a number of results that have applications to the problem of decomposing graphs into trees.
Key features of this second edition include:
\u00b7 a new chapter on magic labeling of directed graphs
\u00b7 applications of theorems from graph theory and interesting counting arguments
\u00b7 new research problems and exercises covering a range of difficulties
\u00b7 a fully updated bibliography and index
This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher.
"}, "covers": [8690054], "key": "/works/OL19885072W", "authors": [{"type": {"key": "/type/author_role"}, "author": {"key": "/authors/OL7574526A"}}], "title": "Magic Graphs", "subjects": ["Mathematics", "Computational complexity", "Combinatorial analysis", "Discrete Mathematics in Computer Science", "Applications of Mathematics", "Magic labelings", "Graph theory"], "type": {"key": "/type/work"}, "latest_revision": 3, "revision": 3, "created": {"type": "/type/datetime", "value": "2019-07-05T05:42:13.222160"}, "last_modified": {"type": "/type/datetime", "value": "2021-12-25T11:03:15.945868"}}