- Файл формата pdf
- размером 17,15 МБ

- Добавлен пользователем Shushimora
- Отредактирован

Издательство Pearson Education, 2001, -871 pp.Graph theory is а delightful playground for the exploration of proof techniques in discrete mathematics, and its results have applications in many areas of the computing, social, and natural sciences. The design of this book permits usage in а one-semester introduction at the undergraduate or beginning graduate level, or in а patient two-semester introduction. No previous knowledge of graph theory is assumed. Many algorithms and applications are included, but the focus is on understanding the structure of graphs and the techniques used to analyze problems in graph theory.

Many textbooks have been written about graph theory. Due to its emphasis on both proofs and applications, the initial model for this book was the elegant text by J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan/North-Ноllаnd [1976]). Graph theory is still young, and no consensus has emerged on how the introductory material should Ье presented. Selection and order of topics, choice of proofs, objectives, and underlying themes are matters of lively debate. Revising this book dozens of times has taught to the difficulty of these decisions. This book is my contribution to the debate.

The revision for the second edition emphasizes making the text easier for the students to learn from and easier for the instructor to teach from. There have not been great changes in the overall content of the book, but the presentation has been modified to make the material more accessible, especially in the early parts of the book.

This book contains more material than most introductory texts in graph theory. Collecting the advanced material as а final optional chapter of "additional topics" permits usage at different levels. The undergraduate introduction consists of the first seven chapters (omitting most optional material), leaving Chapter 8 as topical reading for interested students. А graduate course can treat most of Chapters 1 and 2 as recommended reading, moving rapidly to Chapter 3 in class and reaching some topics in Chapter 8_. Chapter 8 can also be used as the basis for а second course in graph theory, along with material that was optional in earlier chapters.

Many results in graph theory have several proofs; illustrating this can increase students' flexibility in trying multiple approaches to a problem. I include some alternative proofs as remarks and others as exercises. Many exercises have hints, some given with the exercise statement and others in Appendix С. Exercises marked "(-)" or "(+)" are easier or more difficult, respectively, than unmarked problems. Those marked "(+)" should not be assigned as homework in а typical undergraduate course. Exercises marked "(!)" are especially valuable, instructive, or entertaining. Those marked "(*)" use "material labeled optional in the text.

Each exercise section begins with а set of "(-)" exercises, ordered according to the material in the section and ending with а line of bullets. These exercises either check understanding of concepts or are immediate applications of results in the section. I recommend some of these to my class as "warmup" exercises to check their understanding before working the main homework problems, most of which are marked "(!)". Most problems marked "(-)" are good exam questions. When using other exercises on exams, it may be а good idea to provide hints from Appendix С.

Exercises that relate several concepts appear when the last is introduced. Many pointers to exercises appear in the text where relevant concepts are discussed. An exercise in the current section is cited by giving only its item number among the exercises of that section. Other cross-references are by Chapter.Section.ltem.Fundamental Concepts

Тrees and Distance

Matchings and Factors

Connectivity and Paths

Coloring of Graphs

Planar Graphs

Edges and Cycles

Additional Topics (optional)

А Mathematical Background

В Optimization and Complexity

С Hints for Selected Exercises

Many textbooks have been written about graph theory. Due to its emphasis on both proofs and applications, the initial model for this book was the elegant text by J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan/North-Ноllаnd [1976]). Graph theory is still young, and no consensus has emerged on how the introductory material should Ье presented. Selection and order of topics, choice of proofs, objectives, and underlying themes are matters of lively debate. Revising this book dozens of times has taught to the difficulty of these decisions. This book is my contribution to the debate.

The revision for the second edition emphasizes making the text easier for the students to learn from and easier for the instructor to teach from. There have not been great changes in the overall content of the book, but the presentation has been modified to make the material more accessible, especially in the early parts of the book.

This book contains more material than most introductory texts in graph theory. Collecting the advanced material as а final optional chapter of "additional topics" permits usage at different levels. The undergraduate introduction consists of the first seven chapters (omitting most optional material), leaving Chapter 8 as topical reading for interested students. А graduate course can treat most of Chapters 1 and 2 as recommended reading, moving rapidly to Chapter 3 in class and reaching some topics in Chapter 8_. Chapter 8 can also be used as the basis for а second course in graph theory, along with material that was optional in earlier chapters.

Many results in graph theory have several proofs; illustrating this can increase students' flexibility in trying multiple approaches to a problem. I include some alternative proofs as remarks and others as exercises. Many exercises have hints, some given with the exercise statement and others in Appendix С. Exercises marked "(-)" or "(+)" are easier or more difficult, respectively, than unmarked problems. Those marked "(+)" should not be assigned as homework in а typical undergraduate course. Exercises marked "(!)" are especially valuable, instructive, or entertaining. Those marked "(*)" use "material labeled optional in the text.

Each exercise section begins with а set of "(-)" exercises, ordered according to the material in the section and ending with а line of bullets. These exercises either check understanding of concepts or are immediate applications of results in the section. I recommend some of these to my class as "warmup" exercises to check their understanding before working the main homework problems, most of which are marked "(!)". Most problems marked "(-)" are good exam questions. When using other exercises on exams, it may be а good idea to provide hints from Appendix С.

Exercises that relate several concepts appear when the last is introduced. Many pointers to exercises appear in the text where relevant concepts are discussed. An exercise in the current section is cited by giving only its item number among the exercises of that section. Other cross-references are by Chapter.Section.ltem.Fundamental Concepts

Тrees and Distance

Matchings and Factors

Connectivity and Paths

Coloring of Graphs

Planar Graphs

Edges and Cycles

Additional Topics (optional)

А Mathematical Background

В Optimization and Complexity

С Hints for Selected Exercises

- Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
- Регистрация

- Раздел: Дискретная математика → Теория графов

Издательство Springer, 2008, -655 pp.
The present project began with the intention of simply making minor revisions to our earlier book. However, we soon came to the realization that the changing face of the subject called for a total reorganization and enhancement of its contents. As with Graph Theory with Applications, our primary aim here is to present a coherent...

- 4,70 МБ
- добавлен
- изменен

3rd Edition. — MIT Press, 2009. — 1312 p. — ISBN 978-0262033848. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is...

- 4,84 МБ
- дата добавления неизвестна
- изменен

- Раздел: Дискретная математика → Теория графов

CRC Press, 2014. — 1633 p. — 2nd ed. — ISBN: 9781439880180
In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition—over...

- 19,54 МБ
- добавлен
- изменен

2nd ed. — CRC Press, 2013. — 1905 p. — ISBN: 9781466507289
With a substantial amount of new material, the Handbook of Linear Algebra, Second Edition provides comprehensive coverage of linear algebra concepts, applications, and computational software packages in an easy-to-use format. It guides you from the very elementary aspects of the subject to the frontiers of current...

- 34,73 МБ
- добавлен
- изменен

4th edition. — Cambridge University Press, 2009. — 586 p. + Solutions manual.
Архив rar содержит также пособие с решениями всех задач учебника, составленное автором.
Gilbert Strang's textbooks have changed the entire approach to learning linear algebra - away from abstract vector spaces to specific examples of the four fundamental subspaces: the column space and nullspace of A...

- 32,91 МБ
- добавлен
- изменен

- Раздел: Дискретная математика → Теория графов

Mathematics Department University of Illinois, 2005. — 520 p. Решебник к /file/1097419/ This is the Summer 2005 version of the Instructor's Solution Manual for Introduction to Graph Theory , by Douglas B. West. Afew solutions have been added or clari fied since last year's version. Also present is a (slightly edited) annotated syllabus for the one semester course taught from this...

- 3,35 МБ
- добавлен
- изменен