|
|
|
|
| LEADER |
02054nmm a2200325 u 4500 |
| 001 |
EB001346636 |
| 003 |
EBX01000000000000000900826 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
170301 ||| eng |
| 020 |
|
|
|a 9783319526577
|
| 100 |
1 |
|
|a López, Susana C.
|
| 245 |
0 |
0 |
|a Graceful, Harmonious and Magic Type Labelings
|h Elektronische Ressource
|b Relations and Techniques
|c by Susana C. López, Francesc A. Muntaner-Batle
|
| 250 |
|
|
|a 1st ed. 2017
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2017, 2017
|
| 300 |
|
|
|a XII, 134 p. 82 illus
|b online resource
|
| 505 |
0 |
|
|a 1. Notation and terminology -- 2. Graphs labelings -- 3. Super edge magic labelings: first type of relations -- 4. Harmonious labelings -- 5. Graceful labelings: the shifting technique -- 6. The ⊗-product of digraphs: second type of relations -- 7. The polynomial method.
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Graph Theory
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Graph theory
|
| 700 |
1 |
|
|a Muntaner-Batle, Francesc A.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a SpringerBriefs in Mathematics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-319-52657-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-52657-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.5
|
| 520 |
|
|
|a Aimed toward upper undergraduate and graduate students in mathematics, this book examines the foremost forms of graph labelings including magic, harmonious, and graceful labelings. An overview of basic graph theory concepts and notation is provided along with the origins of graph labeling. Common methods and techniques are presented introducing readers to links between graph labels. A variety of useful techniques are presented to analyze and understand properties of graph labelings. The classical results integrated with new techniques, complete proofs, numerous exercises, and a variety of open problems, will provide readers with a solid understanding of graph labelings
|