《Discrete Mathematics II教学-华南理工》6.7 Planar graph.pptVIP

《Discrete Mathematics II教学-华南理工》6.7 Planar graph.ppt

  1. 1、本文档共59页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 3 2 1 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 4 3 1 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 4 4 2 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 5 5 2 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 6 6 2 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 7 7 2 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 8 8 2 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 8 9 3 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 8 10 4 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 8 11 5 2 L25 * Animated Invariance of Euler Characteristic |V | |E | r c = r - |E | + |V | 8 12 6 2 Suppose that a connected planar simple graph has 20 vertices, each of degree 3. Into how many regions does a representation of this planar graph split the plane? Solution: This graph has 20 vertices, each of degree 3, so that v=20.Since the sum of the degrees of the vertices, 3v=60, is equals to twice the number of edges,2e, we have 2e=60, or e=30. Consequencetly, from Euler’s formula, the number of regions is r=e-v+2=30-20+2=12. Example Corollary 1: If G is a connected planar simple graph with e edges and v vertices where v≥3, then e≤3v-6. Hence, (2/3)e ≥r. Using r=e-v+2 we obtained e-v+2 ≤(2/3)e. It follows that e≤3v-6. Q. E. D. Proof: A connected planar simple graph drawn in the plane divides the plane into regions, say r of them. The degree of each region is at least 3(Since the graphs discussed here are simple graphs.) The degree of the unbounded region is at least 3 since there are at least three vertices in the graph . Corollary Show that K5 is nonplan

文档评论(0)

1243595614 + 关注
实名认证
文档贡献者

文档有任何问题,请私信留言,会第一时间解决。

版权声明书
用户编号:7043023136000000

1亿VIP精品文档

相关文档