Cantitate/Preț
Produs

How to Label a Graph: SpringerBriefs in Mathematics

Autor Gary Chartrand, Cooroo Egan, Ping Zhang
en Limba Engleză Paperback – 27 iun 2019
This book depicts graph labelings that have led to thought-provoking problems and conjectures. Problems and conjectures in graceful labelings, harmonious labelings, prime labelings, additive labelings, and zonal labelings are introduced with fundamentals, examples, and illustrations. A new labeling with a connection to the four color theorem is described to aid mathematicians to initiate new methods and techniques to study classical coloring problems from a new perspective. Researchers and graduate students interested in graph labelings will find the concepts and problems featured in this book valuable for finding new areas of research.
Citește tot Restrânge

Din seria SpringerBriefs in Mathematics

Preț: 43096 lei

Nou

Puncte Express: 646

Preț estimativ în valută:
8247 8674$ 6870£

Carte tipărită la comandă

Livrare economică 03-17 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030168629
ISBN-10: 303016862X
Pagini: 101
Ilustrații: XIII, 89 p. 79 illus., 2 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.16 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seria SpringerBriefs in Mathematics

Locul publicării:Cham, Switzerland

Cuprins

1 Introduction.- 2 Graceful Labelings.- 3 Harmonious Labelings.- 4 Prime Labelings.- 5 Additive Labelings.- 6 Zonal Labelings. 

Recenzii

“The writing is crisp, clear and instructive, appropriate for undergraduates with a grasp of graph theory fundamentals. … The book is best suited as a companion text to introduce undergraduate students to graph labeling problems, perhaps via a research workshop.” (André E. Kézdy, Mathematical Reviews, April, 2020)

Caracteristici

Covers fundamentals of different interpretations of labeling graphs Provides examples and illustrations for wide variety of graph labeling Introduces new graph labeling with connection to Four Color Theorem