Graph theory

Note moyenne 
Russell Merris - .
This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical... Lire la suite
99,50 € Neuf
Expédié sous 6 à 12 jours
Livré chez vous entre le 7 février et le 11 février
En librairie

Résumé

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 Polya'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.

Sommaire

  • INVARIANTS
  • CHROMATIC NUMBER
  • CONNECTIVITY
  • PLANAR GRAPHS
  • HAMILTONIAN CYCLES
  • MATCHINGS
  • GRAPHIC SEQUENCES
  • CHORDAL GRAPHS
  • ORIENTED GRAPHS
  • EDGE COLORINGS

Caractéristiques

  • Date de parution
    01/01/2001
  • Editeur
  • Collection
  • ISBN
    0-471-38925-0
  • EAN
    9780471389255
  • Présentation
    Relié
  • Nb. de pages
    237 pages
  • Poids
    0.575 Kg
  • Dimensions
    16,0 cm × 24,0 cm × 2,2 cm

Avis libraires et clients

À propos de l'auteur

Biographie de Russell Merris

RUSSELL MERRIS, PhD, is Professor of Mathematics and Computer Science at California State University, Hayward.

Les clients ont également aimé

Derniers produits consultés

99,50 €