{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":22,"n_cols":5,"rows_kept":22,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910437870703321"]
[null,null,"Autore",null,"Marr Alison M"]
[null,null,"Titolo",null,"Magic Graphs / / by Alison M. Marr, W.D. Wallis"]
[null,null,"Pubbl/distr/stampa",null,"New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2013"]
[null,null,"ISBN",null,"0-8176-8391-7"]
[null,null,"Edizione",null,"[2nd ed. 2013.]"]
[null,null,"Descrizione fisica",null,"1 online resource (198 p.)"]
[null,null,"Disciplina",null,"511.5"]
[null,null,"Soggetti",null,"Combinatorial analysis"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Applied mathematics"]
[{"$nulls":4},"Engineering mathematics"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Applications of Mathematics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes Index."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (pages [163]-169) and index."]
[null,null,"Nota di contenuto",null,"Preface -- List of Figures -- Preliminaries -- Edge-Magic Total Labelings -- Vertex-Magic Total Labelings -- Totally Magic Labelings -- Magic Type Labeling of Digraphs -- Notes on the Research Problems -- References -- Bibliography -- Answers to Selected Exercises -- Index."]
[null,null,null,"Sommario/riassunto","Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of “magic” ideas have been applied to graphs. Recently there has been a resurgence of interest in “magic labelings” due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include: ·         a new chapter on magic labeling of directed graphs ·         applications of theorems from graph theory and interesting counting arguments ·         new research problems and exercises covering a range of difficulties ·         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."]