LEADER 03593nam  22006975  450 
001 9910437870703321
005 20200705074725.0
010   $a0-8176-8391-7
024 7 $a10.1007/978-0-8176-8391-7
035   $a(CKB)2670000000299155
035   $a(EBL)1081661
035   $a(OCoLC)820362280
035   $a(SSID)ssj0000813508
035   $a(PQKBManifestationID)11432802
035   $a(PQKBTitleCode)TC0000813508
035   $a(PQKBWorkID)10786705
035   $a(PQKB)10485830
035   $a(DE-He213)978-0-8176-8391-7
035   $a(MiAaPQ)EBC1081661
035   $a(MiAaPQ)EBC6312496
035   $a(PPN)168288729
035   $a(EXLCZ)992670000000299155
100   $a20121116d2013      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aMagic Graphs /$fby Alison M. Marr, W.D. Wallis
205   $a2nd ed. 2013.
210  1$aNew York, NY :$cSpringer New York :$cImprint: Birkhäuser,$d2013.
215   $a1 online resource (198 p.)
300   $aIncludes Index.
311   $a0-8176-8390-9 
320   $aIncludes bibliographical references (pages [163]-169) and index.
327   $aPreface -- 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.
330   $aMagic 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.
606   $aCombinatorial analysis
606   $aComputer science?Mathematics
606   $aApplied mathematics
606   $aEngineering mathematics
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003
615  0$aCombinatorial analysis.
615  0$aComputer science?Mathematics.
615  0$aApplied mathematics.
615  0$aEngineering mathematics.
615 14$aCombinatorics.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aApplications of Mathematics.
676   $a511.5
700   $aMarr$b Alison M$4aut$4http://id.loc.gov/vocabulary/relators/aut$01064748
702   $aWallis$b W.D$4aut$4http://id.loc.gov/vocabulary/relators/aut
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910437870703321
996   $aMagic Graphs$92540533
997   $aUNINA