LEADER 03618nam  22006135  450 
001 9910392719803321
005 20200630102718.0
010   $a3-030-24582-9
024 7 $a10.1007/978-3-030-24582-5
035   $a(CKB)4100000009273646
035   $a(DE-He213)978-3-030-24582-5
035   $a(MiAaPQ)EBC5897161
035   $a(PPN)24860189X
035   $a(EXLCZ)994100000009273646
100   $a20190914d2019      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aMagic and Antimagic Graphs $eAttributes, Observations and Challenges in Graph Labelings /$fby Martin Ba?a, Mirka Miller, Joe Ryan, Andrea Semani?ová-Fe?ov?íková
205   $a1st ed. 2019.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019.
215   $a1 online resource (XV, 322 p. 165 illus.) 
225 1 $aDevelopments in Mathematics,$x1389-2177 ;$v60
311   $a3-030-24581-0 
327   $aPreface -- 1 Introduction -- 2 Magic and supermagic graphs -- 3 Vertex-magic total labelings -- 4 Edge-magic total labelings -- 5 Vertex-antimagic total labelings -- 6 Edge-antimagic total labelings -- 7 Graceful and antimagic labelings -- 8 Conclusion -- Glossary of abbreviations used in the text -- Bibliography -- Index.
330   $aMagic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph. Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.
410  0$aDevelopments in Mathematics,$x1389-2177 ;$v60
606   $aGraph theory
606   $aCombinatorics
606   $aComputer science?Mathematics
606   $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020
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
615  0$aGraph theory.
615  0$aCombinatorics.
615  0$aComputer science?Mathematics.
615 14$aGraph Theory.
615 24$aCombinatorics.
615 24$aDiscrete Mathematics in Computer Science.
676   $a511.5
676   $a511.5
700   $aBa?a$b Martin$4aut$4http://id.loc.gov/vocabulary/relators/aut$01062366
702   $aMiller$b Mirka$4aut$4http://id.loc.gov/vocabulary/relators/aut
702   $aRyan$b Joe$4aut$4http://id.loc.gov/vocabulary/relators/aut
702   $aSemani?ová-Fe?ov?íková$b Andrea$4aut$4http://id.loc.gov/vocabulary/relators/aut
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910392719803321
996   $aMagic and Antimagic Graphs$92525169
997   $aUNINA