Introduction to Graph Theory (5th Edition) 🔍
Robin J. Wilson Prentice Hall/Pearson, 5th ed., Harlow, England, New York, England, 2010
英语 [en] · DJVU · 3.5MB · 2010 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save
描述
In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson’s book has been widely used as a text for undergraduate courses in mathematics, computer science and economics, and as a readable introduction to the subject for non-mathematicians.
The opening chapters provide a basic foundation course, containing definitions and examples, connectedness, Eulerian and Hamiltonian paths and cycles, and trees, with a range of applications. This is followed by two chapters on planar graphs and colouring, with special reference to the four-colour theorem. The next chapter deals with transversal theory and connectivity, with applications to network flows. A final chapter on matroid theory ties together material from earlier chapters, and an appendix discusses algorithms and their efficiency.
备用文件名
lgli/M_Mathematics/MA_Algebra/MAc_Combinatorics/Wilson R.J. Introduction to graph theory (5ed., Pearson, 2010)(ISBN 9780273728894)(600dpi)(K)(T)(O)(193s)_MAc_.djvu
备用文件名
nexusstc/Introduction to Graph Theory/a68e7289df60eb23a7130c4439a87730.djvu
备用文件名
lgrsnf/Wilson R.J. Introduction to graph theory (5ed., Pearson, 2010)(ISBN 9780273728894)(600dpi)(K)(T)(O)(193s)_MAc_.djvu
备用文件名
zlib/Mathematics/Robin J. Wilson/Introduction to Graph Theory (5th Edition)_5649966.djvu
备选标题
Introduction to Graph Theory UPDF EBook
备选标题
Введение в теорию графов
备选作者
Робин Уилсон; перевод с английского и редакция И. В. Красикова
备选作者
Wilson, Robin J.
备选作者
Уилсон, Робин Дж
备用出版商
Pearson Education Limited
备用出版商
Диалектика
备用出版商
Longman
备用版本
United Kingdom and Ireland, United Kingdom
备用版本
Москва, Санкт-Петербург, Russia, 2019
备用版本
Pearson Education (UK), Harlow, 2015
元数据中的注释
lg2710705
元数据中的注释
{"edition":"5","isbns":["027372889X","9780273728894"],"last_page":192,"publisher":"Pearson"}
元数据中的注释
Includes bibliographical references and index.
元数据中的注释
Предм. указ.: с. 236-239
Библиогр.: с. 215-217
Пер.: Wilson, Robin J. Introduction to graf theory 5th ed. Harlow [etc.]: Pearson 978-0-273-72889-4
元数据中的注释
РГБ
元数据中的注释
Russian State Library [rgb] MARC:
=001 010151593
=005 20191121150056.0
=008 191111s2019\\\\ru\\\\\\\\\\\\000\|\rus|d
=017 \\ $a КН-П-19-085110 $b RuMoRKP
=020 \\ $a 978-5-907144-75-0 $c 500 экз.
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=044 \\ $a ru
=084 \\ $a В182.1я9 $2 rubbk
=100 1\ $a Уилсон, Робин Дж.
=245 00 $a Введение в теорию графов $c Робин Уилсон ; перевод с английского и редакция И. В. Красикова
=260 \\ $a Москва ; $a Санкт-Петербург $b Диалектика $c 2019
=300 \\ $a 239 с. $b ил., табл. $c 24 см
=336 \\ $a Текст (визуальный)
=337 \\ $a непосредственный
=500 \\ $a Предм. указ.: с. 236-239
=504 \\ $a Библиогр.: с. 215-217
=534 \\ $p Пер.: $a Wilson, Robin J. $t Introduction to graf theory $b 5th ed. $c Harlow [etc.]: Pearson $z 978-0-273-72889-4
=650 \7 $a Физико-математические науки -- Математика -- Геометрия и топология -- Топология -- Топология первых трех измерений. Узлы. Графы -- Популярные издания $2 rubbk
=852 \\ $a РГБ $b FB $j 2 19-65/259 $x 90
=852 7\ $a РГБ $b CZ2 $h В17/У36 $x 83
=852 \\ $a РГБ $b ORF $x 82
备用描述
<p><b>Introduction to Graph Theory</b></p><p>5th edition</p><p><i>‘An excellent introduction on an increasingly popular topic’</i></p><p>G. Jones, University of Southampton</p><p><i>'If this book did not exist, it would be necessary to invent it!'</i></p><p>B. Cooper, University of Leeds</p><p><i>'I have always regarded Wilson's book as THE undergraduate textbook on graph theory, without a rival'</i></p><p>D. Sharpe, University of Sheffield</p><p>In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson’s book has been widely used as a text for undergraduate courses in mathematics, computer science and economics, and as a readable introduction to the subject for non-mathematicians.</p><p>The opening chapters provide a basic foundation course, containing definitions and examples, connectedness, Eulerian and Hamiltonian paths and cycles, and trees, with a range of applications. This is followed by two chapters on planar graphs and colouring, with special reference to the four-colour theorem. The next chapter deals with transversal theory and connectivity, with applications to network flows. A final chapter on matroid theory ties together material from earlier chapters, and an appendix discusses algorithms and their efficiency.</p><p>For this new edition the text has been revised throughout, and several sections have been reorganised and renumbered. Some new material has been added – notably on the proof of the four-colour theorem, the bracing of rectangular frameworks and algorithms – and the number of exercises has been increased and more solutions are provided.</p><p><b>Robin Wilson</b> is Emeritus Professor of Pure Mathematics at the Open University, and Emeritus Professor of Geometry at Gresham College, London. He is also a former Fellow in Mathematics at Keble College, Oxford University, and now teaches at Pembroke College. He has written and edited almost 40 books on graph theory, combinatorics, the history of mathematics, and music, and is very involved with the communication and popularisation of mathematics.</p>
备用描述
Cover
Title page
Contents
Preface to the fifth edition
Introduction
1 Definitions and examples
1.1 Definitions
1.2 Examples
1.3 Variations on a theme
1.4 Three puzzles
2 Paths and cycles
2.1 Connectivity
2.2 Eulerian graphs and digraphs
2.3 Hamiltonian graphs and digraphs
2.4 Applications
3 Trees
3.1 Properties of trees
3.2 Counting trees
3.3 More applications
4 Planarity
4.1 Planar graphs
4.2 Euler's formula
4.3 Dual graphs
4.4 Graphs on other surfaces
5 Colouring graphs
5.1 Colouring vertices
5.2 Chromatic polynomials
5.3 Colouring maps
5.4 The four-colour theorem
5.5 Colouring edges
6 Matching, marriage and Menger's theorem
6.1 Hall's marriage theorem
6.2 Mengers theorem
6.3 Network flows
7 Matroids
7.1 Introduction to matroids
7.2 Examples of matroids
7.3 Matroids and graphs
Appendix 1: Algorithms
Appendix 2: Table of numbers
List of symbols
Bibliography
Solutions to selected exercises
Index
开源日期
2020-07-27
更多信息……

🚀 快速下载

成为会员以支持书籍、论文等的长期保存。为了感谢您对我们的支持,您将获得高速下载权益。❤️
如果您本月捐款,您将获得额外1个月适用于3个月以上的会员订阅。 每个账户最多获得1个额外月份。

🐢 低速下载

由可信的合作方提供。 更多信息请参见常见问题解答。 (可能需要验证浏览器——无限次下载!)

所有选项下载的文件都相同,应该可以安全使用。即使这样,从互联网下载文件时始终要小心。例如,确保您的设备更新及时。
  • 对于大文件,我们建议使用下载管理器以防止中断。
    推荐的下载管理器:Motrix
  • 您将需要一个电子书或 PDF 阅读器来打开文件,具体取决于文件格式。
    推荐的电子书阅读器:Anna的档案在线查看器ReadEraCalibre
  • 使用在线工具进行格式转换。
    推荐的转换工具:CloudConvertPrintFriendly
  • 您可以将 PDF 和 EPUB 文件发送到您的 Kindle 或 Kobo 电子阅读器。
    推荐的工具:亚马逊的“发送到 Kindle”djazz 的“发送到 Kobo/Kindle”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起,请考虑购买原版,或直接支持作者。
    📚 如果您当地的图书馆有这本书,请考虑在那里免费借阅。