Graph Theory

Graph Theory

Russell Merris(auth.)
0 / 0
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
A lively invitation to the flavor, elegance, and power of graph theory
This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory.
Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to P??'s enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra.
The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject.Content:
Chapter 1 Invariants (pages 1–20):
Chapter 2 Chromatic Number (pages 21–43):
Chapter 3 Connectivity (pages 45–62):
Chapter 4 Planar Graphs (pages 63–82):
Chapter 5 Hamiltonian Cycles (pages 83–101):
Chapter 6 Matchings (pages 103–124):
Chapter 7 Graphic Sequences (pages 125–145):
Chapter 8 Chordal Graphs (pages 147–169):
Chapter 9 Oriented Graphs (pages 171–194):
Chapter 10 Edge Colorings (pages 195–210):
Categories:
Content Type:
Books
Year:
2000
Publisher:
Wiley-Interscience
Language:
english
Pages:
244
ISBN 10:
1118033043
ISBN 13:
9781118033043
File:
PDF, 11.98 MB
IPFS:
CID , CID Blake2b
english, 2000
pdf, 11.98 MB
Conversion to is in progress
Conversion to is failed

Most frequently terms