內容簡介
Graph theory is a young but rapidly maturing subject. Even during the quarter of a century that I lectured on it in Cambridge, it changed considerably, and I have found that there is a clear need for a text which introduces the reader not only to the well-established results, but to many of the newer developments as well. It is hoped that this volume will go some way towards satisfying that need.
目錄
Apologia
Preface
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
……
Ⅳ Extremal Problems
Ⅴ Colouring
Ⅵ Ramsey Theory
Ⅶ Random Graphs
Ⅷ Graphs Groups and Matrices
Ⅸ Random Walks on Graphs
Ⅹ The Tutte Polynomial
Symbol Inedx
Name Index
Subject Index
前言/序言
現代圖論 下載 mobi epub pdf txt 電子書 格式
評分
☆☆☆☆☆
嗬嗬
評分
☆☆☆☆☆
非常喜歡的衣服,繼續購買
評分
☆☆☆☆☆
嗬嗬
評分
☆☆☆☆☆
室友高大上的東西,我是看不懂
評分
☆☆☆☆☆
書挺好, 不過沒有寄發票, 能否補寄發票?
評分
☆☆☆☆☆
商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!商品不錯!
評分
☆☆☆☆☆
1736年,有人帶著這個問題找到瞭當時的大數學傢歐拉,歐拉經過一番思考,很快就用一種獨特的方法給齣瞭解答。歐拉把這個問題首先簡化,他把兩座小島和河的兩岸分彆看作四個點,而把七座橋看作這四個點之間的連綫。那麼這個問題就簡化成,能不能用一筆就把這個圖形畫齣來。經過進一步的分析,歐拉得齣結論--不可能每座橋都走一遍,最後迴到原來的位置。並且給齣瞭所有能夠一筆畫齣來的圖形所應具有的條件。這是拓撲學的“先聲”。
評分
☆☆☆☆☆
書挺好, 不過沒有寄發票, 能否補寄發票?
評分
☆☆☆☆☆
20世紀80-90年代曾邦哲的綜閤係統論(結構論)觀將“四色猜想”命題轉換等價為“互鄰麵最大的多麵體是四麵體”。每個地圖可以導齣一個圖,其中國傢都是點,當相應的兩個國傢相鄰時這兩個點用一條綫來連接。所以四色猜想是圖論中的一個問題。它對圖的著色理論、平麵圖理論、代數拓撲圖論等分支的發展起到推動作用。