第 1/1 張圖片
![Modern Graph Theory [Graduate Texts in Mathematics, 184] - 第 1/1 張圖片](https://i.ebayimg.com/images/g/C8AAAOSw6lxZcVqE/s-l500.jpg)
圖片庫
第 1/1 張圖片
![Modern Graph Theory [Graduate Texts in Mathematics, 184] - 第 1/1 張圖片](https://i.ebayimg.com/images/g/C8AAAOSw6lxZcVqE/s-l500.jpg)
有類似物品要出售?
Modern Graph Theory [Graduate Texts in Mathematics, 184]
Zebrasbooks-2
(4872)
US $21.63
大約HK$ 168.19
狀況:
很新
狀況完好的書籍。封面發亮且沒有損壞,精裝本書籍含書皮。不存在缺頁或內頁受損,無褶皺或破損,同時也沒有對文字標注/標記,或在留白處書寫內容。內封面上標記極少。書籍的磨損和破損程度也很低。
最後 1 件賣出 1 件
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
運送:
免費 USPS Media MailTM.
所在地:Somerset, New Jersey, 美國
送達日期:
估計於 9月29日 (星期一)至 10月4日 (星期六)之間送達 運送地點 94104
退貨:
30 日退貨. 由買家支付退貨運費,如果你使用 eBay 郵寄標籤,相關費用將從你的退款金額中扣除.
保障:
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
(不符合「eBay 買家保障方案」資格)
物品細節
- 物品狀況
- 很新: 狀況完好的書籍。封面發亮且沒有損壞,精裝本書籍含書皮。不存在缺頁或內頁受損,無褶皺或破損,同時也沒有對文字標注/標記,或在留白處書寫內容。內封面上標記極少。書籍的磨損和破損程度也很低。 查看所有物品狀況定義會在新視窗或分頁中開啟
- ISBN
- 9780387984889
關於產品
Product Identifiers
Publisher
Springer New York
ISBN-10
0387984887
ISBN-13
9780387984889
eBay Product ID (ePID)
540199
Product Key Features
Number of Pages
Xiv, 394 Pages
Language
English
Publication Name
Modern Graph Theory
Publication Year
1998
Subject
Graphic Methods, Computer Science, Applied, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics, Computers
Series
Graduate Texts in Mathematics Ser.
Format
Trade Paperback
Dimensions
Item Height
0.3 in
Item Weight
44.8 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
98-011960
Dewey Edition
21
Reviews
"...This book is likely to become a classic, and it deserves to be on the shelf of everyone working in graph theory or even remotely related areas, from graduate student to active researcher."--MATHEMATICAL REVIEWS
Series Volume Number
184
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
511.5
Table Of Content
I Fundamentals.- I.1 Definitions.- I.2 Paths, Cycles, and Trees.- I.3 Hamilton Cycles and Euler Circuits.- I.4 Planar Graphs.- I.5 An Application of Euler Trails to Algebra.- I.6 Exercises.- II Electrical Networks.- II.1 Graphs and Electrical Networks.- II.2 Squaring the Square.- II.3 Vector Spaces and Matrices Associated with Graphs.- II.4 Exercises.- II.5 Notes.- III Flows, Connectivity and Matching.- III.1 Flows in Directed Graphs.- III.2 Connectivity and Menger's Theorem.- III.3 Matching.- III.4 Tutte's 1-Factor Theorem.- III.5 Stable Matchings.- III.6 Exercises.- III.7 Notes.- IV Extremal Problems.- IV.1 Paths and Cycles.- IV.2 Complete Subgraphs.- IV.3 Hamilton Paths and Cycles.- W.4 The Structure of Graphs.- IV 5 Szemerédi's Regularity Lemma.- IV 6 Simple Applications of Szemerédi's Lemma.- IV.7 Exercises.- IV.8 Notes.- V Colouring.- V.1 Vertex Colouring.- V.2 Edge Colouring.- V.3 Graphs on Surfaces.- V.4 List Colouring.- V.5 Perfect Graphs.- V.6 Exercises.- V.7 Notes.- VI Ramsey Theory.- VI.1 The Fundamental Ramsey Theorems.- VI.2 Canonical Ramsey Theorems.- VI.3 Ramsey Theory For Graphs.- VI.4 Ramsey Theory for Integers.- VI.5 Subsequences.- VI.6 Exercises.- VI.7 Notes.- VII Random Graphs.- VII.1 The Basic Models-The Use of the Expectation.- VII.2 Simple Properties of Almost All Graphs.- VII.3 Almost Determined Variables-The Use of the Variance.- VII.4 Hamilton Cycles-The Use of Graph Theoretic Tools.- VII.5 The Phase Transition.- VII.6 Exercises.- VII.7 Notes.- VIII Graphs, Groups and Matrices.- VIII.1 Cayley and Schreier Diagrams.- VIII.2 The Adjacency Matrix and the Laplacian.- VIII.3 Strongly Regular Graphs.- VIII.4 Enumeration and Pólya's Theorem.- VIII.5 Exercises.- IX Random Walks on Graphs.- IX.1 Electrical Networks Revisited.- IX.2 Electrical Networks and Random Walks.- IX.3 Hitting Times and Commute Times.- IX.4 Conductance and Rapid Mixing.- IX.5 Exercises.- IX.6 Notes.- X The Tutte Polynomial.- X.1 Basic Properties of the Tutte Polynomial.- X.2The Universal Form of the Tutte Polynomial.- X.3 The Tutte Polynomial in Statistical Mechanics.- X.4 Special Values of the Tutte Polynomial.- X.5 A Spanning Tree Expansion of the Tutte Polynomial.- X.6 Polynomials of Knots and Links.- X.7 Exercises.- X.8 Notes.- Symbol Index.- Name Index.
Synopsis
This book is an in-depth account of graph theory, written with students of mathematics and computer science in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. In addition to classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed survey of newer topics, and includes more than 600 exercises., The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader., The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader., Graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in -depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject., The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest.In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory.In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.
LC Classification Number
QA297.4
賣家提供的物品說明
賣家信用評價 (5,024)
- Automatische Bewertung von eBay- 買家留下的信用評價。過去 1 個月Bestellung erfolgreich durchgeführt - mit Sendungsverfolgung und fristgerecht
- Automatische Bewertung von eBay- 買家留下的信用評價。過去 1 個月Bestellung erfolgreich durchgeführt - mit Sendungsverfolgung und fristgerecht