欢迎来到麦多课文档分享! | 帮助中心 海量文档,免费浏览,给你所需,享你所想!
麦多课文档分享
全部分类
  • 标准规范>
  • 教学课件>
  • 考试资料>
  • 办公文档>
  • 学术论文>
  • 行业资料>
  • 易语言源码>
  • ImageVerifierCode 换一换
    首页 麦多课文档分享 > 资源分类 > PPT文档下载
    分享到微信 分享到微博 分享到QQ空间

    Applied Combinatorics, 4th Ed.Alan Tucker.ppt

    • 资源ID:378511       资源大小:174.50KB        全文页数:14页
    • 资源格式: PPT        下载积分:2000积分
    快捷下载 游客一键下载
    账号登录下载
    微信登录下载
    二维码
    微信扫一扫登录
    下载资源需要2000积分(如需开发票,请勿充值!)
    邮箱/手机:
    温馨提示:
    如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
    如需开发票,请勿充值!如填写123,账号就是123,密码也是123。
    支付方式: 支付宝扫码支付    微信扫码支付   
    验证码:   换一换

    加入VIP,交流精品资源
     
    账号:
    密码:
    验证码:   换一换
      忘记密码?
        
    友情提示
    2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
    3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
    4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
    5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。

    Applied Combinatorics, 4th Ed.Alan Tucker.ppt

    1、1/25/2005,Tucker, Sec. 1.2,1,Applied Combinatorics, 4th Ed. Alan Tucker,Section 1.2 IsomorphismPrepared by Jo Ellis-Monaghan,1/25/2005,Tucker, Sec. 1.2,2,Two graphs G and are isomorphic if :There exists a one-to-one correspondence between vertices in G and , such thatThere is an edge between a and b

    2、 in G if and only if there is an edge between the corresponding vertices and in .The definition for oriented graphs is the same, except the head and tail of each edge of G must correspond to the head and tail in .,Definition of Isomorphism,1/25/2005,Tucker, Sec. 1.2,3,Example of isomorphic graphs,a,

    3、b,c,d,e,f,1,2,3,4,5,6,G,1/25/2005,Tucker, Sec. 1.2,4,Kn, the complete graph on n vertices,K2,K3,K5,K8,K4,K1,1/25/2005,Tucker, Sec. 1.2,5,The complement of a graph,The complement of G has all the edges that are missing in Gi.e. that would have to be added to make the complete graph.,G,1/25/2005,Tucke

    4、r, Sec. 1.2,6,Advantage of the complement,Theorem:Two graphs, G and H, are isomorphic if and only if their complements are.In practice this means that we work with whichever of G or has few edges.,1/25/2005,Tucker, Sec. 1.2,7,Subgraphs,Definition: if G is a graph, a subgraph H of G consists of a sub

    5、set V of the vertices of G, and a subset of the edges of G with endpoints in V.,c,d,e,i,j,k,f,l,Two subgraphs of G,1/25/2005,Tucker, Sec. 1.2,8,Induced subgraphs,Choose a subset of the vertices of G, then include only the edges among those vertices.,n,a,b,c,d,e,f,g,h,i,j,k,l,m,o,A graph G,Subgraph i

    6、nduced by the vertices of degree 4.,1/25/2005,Tucker, Sec. 1.2,9,Elementary properties of isomorphic graphs,Edge and vertex counts Isomorphic graphs have the same number of edges and vertices.Vertex sequence (the list of vertex degrees) Isomorphic graphs have the same vertex sequences.Warning! These

    7、 can be used to show two graphs are not isomorphic, but can not show that two graphs are isomorphic.,1/25/2005,Tucker, Sec. 1.2,10,Two non-isomorphic graphs,Vertices: 6 Edges: 7 Vertex sequence: 4, 3, 3, 2, 2, 0.,Vertices: 6 Edges: 7 Vertex sequence: 5, 3, 2, 2, 1, 1.,1/25/2005,Tucker, Sec. 1.2,11,S

    8、ubgraph properties of isomorphic graphs,Isomorphic graphs have the same sets of subgraphs:there is a one-to-one correspondence between the subgraphs such that corresponding subgraphs are isomorphic.Typically check induced subgraphs, or number of a specific kind of subgraphs such as cycles or cliques

    9、.Warning! These can be used to show two graphs are not isomorphic, but can not show that two graphs are isomorphic.,1/25/2005,Tucker, Sec. 1.2,12,Two non-isomorphic graphs,a,c,d,2,3,5,6,7,8,1,4,Vertices: 8 Edges: 10 Vertex sequence: 3, 3, 3, 3, 2, 2, 2, 2.,Vertices: 8 Edges: 10 Vertex sequence: 3, 3

    10、, 3, 3, 2, 2, 2, 2.,However, induced subgraphs on degree 3 vertices are NOT isomorphic!,3,1/25/2005,Tucker, Sec. 1.2,13,An approach to checking isomorphism:,Count the vertices. The graphs must have an equal number.Count the edges. The graphs must have an equal number.Check vertex degree sequence. Ea

    11、ch graph must have the same degree sequence.Check induced subgraphs for isomorphism. If the subgraphs are not isomorphic, then the larger graphs are not either. Count numbers of cycles/cliques. If these tests dont help, and you suspect the graphs actually are isomorphic, then try to find a one-to-on

    12、e correspondence between vertices of one graph and vertices of the other. Remember that a vertex of degree n in the one graph must correspond to a vertex of degree n in the other.,1/25/2005,Tucker, Sec. 1.2,14,For the class to try:,a,b,f,e,c,d,1,2,3,4,5,6,Are these pairs of graphs isomorphic?,#1,#2,Isomorphic: a-1, b-5, c-4, d-3, e-2, f-6.,Not Isomorphic: 5 K3s on left, 4 K3s on right.,a,b,c,d,f,g,e,1,2,3,4,5,6,7,


    注意事项

    本文(Applied Combinatorics, 4th Ed.Alan Tucker.ppt)为本站会员(progressking105)主动上传,麦多课文档分享仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文档分享(点击联系客服),我们立即给予删除!




    关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

    copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
    备案/许可证编号:苏ICP备17064731号-1 

    收起
    展开