离散数学(四)_08(精品·公开课件).ppt

下载文档

3
0
约1.44万字
约 80页
2018-11-06 发布于广西
举报
版权申诉
保障服务

离散数学(四)_08(精品·公开课件).ppt

1、本文档共80页，可阅读全部内容。
2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Discrete Mathematics Shandong University Qilu Software College Chapter 9 Graphs §9.1 Graphs And Graph Models (2) 9.1.1 Definition §9.1 Graphs And Graph Models (3) 9.1.1 Definition §9.1 Graphs And Graph Models (4) 9.1.1 Definition §9.1 Graphs And Graph Models (5) 9.1.1 Definition §9.1 Graphs And Graph Models (6) §9.1 Graphs And Graph Models (7) §9.1 Graphs And Graph Models (8) §9.2 Graph terminology and Special Types of Graphs (1) §9.2 Graph terminology and Special Types of Graphs (2) §9.2 Graph terminology and Special Types of Graphs (3) §9.2 Graph terminology and Special Types of Graphs (4) §9.2 Graph terminology and Special Types of Graphs (5) §9.2 Graph terminology and Special Types of Graphs (6) §9.2 Graph terminology and Special Types of Graphs (7) §9.2 Graph terminology and Special Types of Graphs (8) §9.2 Graph terminology and Special Types of Graphs (9) §9.2 Graph terminology and Special Types of Graphs (10) §9.2 Graph terminology and Special Types of Graphs (11) §9.6 Shortest-Path Problems (2) §9.6 Shortest-Path Problems (3) §9.7 Planar Graphs (1) §9.7 Planar Graphs (2) §9.7 Planar Graphs (3) §9.7 Planar Graphs (4) §9.7 Planar Graphs (5) §9.7 Planar Graphs (6) §9.7 Planar Graphs (7) §9.7 Planar Graphs (8) Jordan Curve A Jordan curve is a plane curve which is topologically equivalent to (a homeomorphic image of) the unit circle, i.e., it is simple and closed. Jordan Curve Theorem Any continuous simple closed curve in the plane, separates the plane into two disjoint regions, the inside and the outside. Euler’s Formula： Let G be a connected planar simple graph with m edges and n vertices. Let r be the number of regions in a planar representation of G.T