• формат djvu
  • размер 1.07 МБ
  • добавлен 28 октября 2011 г.
Ore O. Graphs and their Uses
The Mathematical Association of America, 1996, -158 pp.
This book is one of a series written by professional mathematicians in order to make some important mathematical ideas interesting and understandable to a large audience of high school students and laymen. Most of the volumes in the New Mathematical Library cover topics not usually included in the high school curriculum; they vary in difficulty, and, even within a single book, some parts require a greater degree of concentration than others. Thus, while you need little technical knowledge to understand most of these books, you will have to make an intellectual effort. If you have so far encountered mathematics only in classroom work, you should keep in mind that a book on mathematics cannot be read quickly. Nor must you expect to understand all parts of the book on first reading. You should feel free to skip complicated parts and retu to them later; often an argument will be clarified by a subsequent remark. On the other hand, sections containing thoroughly familiar material may be read very quickly.
The best way to lea mathematics is to do mathematics, and each book includes problems, some of which may require considerable thought. You are urged to acquire the habit of reading with paper and pencil in hand; in this way, mathematics will become increasingly meaningful to you.
What Is a Graph?
Connected Graphs.
Trees.
Matchings.
Directed Graphs.
Questions Conceing Games and Puzzles.
Relations.
Planar Graphs.
Map Coloring.
Похожие разделы
Смотрите также

Bollob?s B. (ed.) Advances in Graph Theory

  • формат djvu
  • размер 2.16 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1978, -305 pp. Annals of Discrete Mathematics, Number 3. which received an equally memorable reply. Several of the papers were quickly and efficiently retyped by Mrs. J.E. Scutt. The editorial burden was greatly relieved by the excellent work of Mr. A.G. Thomason. Linear separation of dominating sets in graphs. Regularisable graphs. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Extremal gr...

Bollob?s B. (ed.) Graph Theory

  • формат djvu
  • размер 1.12 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1982, -210 pp. Annals of Discrete Mathematics, Number 13. Proceedings of the Conference on Graph Theory, Cambridge. The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contributions, suitably refereed and revised. For many years now,...

Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory

  • формат pdf
  • размер 6.18 МБ
  • добавлен 19 марта 2011 г.
Cambridge University Press, 1991. - 380 pages. The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix and Latin squares. The book ends by considering algebraic chara...

Capobianco M., Moluzzo J.C. Examples and Counterexamples in Graph Theory

  • формат pdf
  • размер 12.91 МБ
  • добавлен 16 марта 2011 г.
North-Holland, 1978. - 270 pages. It is a real pleasure, indeed an honor, for me to have been invited by Mike Capobianco and John Molluzzo to write an introduction to this imaginative and valuable addition to graph theory. Let me therefore present a few of my thoughts on the current status of graph theory and how their work contributes to the field. Graphs have come a long way since 1736 when Leonhard Euler applied a graph-theoretic argument to...

Chartrand G., Lesniak L. Graphs and Digraphs

  • формат djvu
  • размер 2.67 МБ
  • добавлен 26 октября 2011 г.
Издательство Chapman and Hall/CRC Press, 1996, -429 pp. Graph theory is a major area of combinatorics, and during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. As in the first edition of Graphs & Digraphs (M. Behzad, G. Chartrand, L. Lesniak) and the second...

Chung F.R.K. Lectures on Spectral Graph Theory

  • формат pdf
  • размер 190.11 КБ
  • добавлен 01 декабря 2011 г.
Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for cartesian products. Diameters and eigenvalues. The diameter of a gr...

Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs

  • формат djvu
  • размер 2.3 МБ
  • добавлен 24 октября 2011 г.
Издательство Academic Press, 1980, -303 pp. Research in graph theory and its applications has increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a search for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph, the main task for the mathematician is to eliminate the often arbitrary and cumbersome defin...

Ore O. The Four Color Problem

  • формат pdf
  • размер 8.97 МБ
  • добавлен 01 января 2012 г.
N. Y. ; L. : Academic Press, 1967.— xvi, 260 p. Puzzling problems permeate mathematics, and this is probably the strongest reason for the burgeoning growth of this queen of the sciences. The object of this book is to discuss the methods in graph theory that have been developed in the last century for attacking the four-color problem. It may be said without exaggeration concerning the writers on graph theory in this period, that however practical...

Ore O. Theory of graphs

  • формат djvu
  • размер 1.63 МБ
  • добавлен 08 октября 2009 г.
279 c. 1962 г. 1. Fundamental concepts 2. Connectedness 3. Path problems 4. Trees 5. Leaves and lobes 6. The axiom of choice 7. Matching theorems 8. Directed graphs 9. Acyclic graphs 10. Partial order 11. Binary relations and Galois correspondences 12. Connecting paths 13. Dominating sets, covering sets, and independent sets 14. Chromatic graphs 15. Groups and graphs

Wilson R.J. Introduction to Graph Theory, 4th Edition

  • формат pdf
  • размер 13.09 МБ
  • добавлен 31 января 2011 г.
Addison Wesley – 1996, 184 pages, ISBN: 0582249937. Provides a basic foundation on trees, algorithms, Eulerian and Hamilton graphs, planar graphs and coloring, with special reference to four color theorem. Discusses directed graphs and transversal theory and related these areas to Markov chains and network flows.