数学与应用数学 图同构的判定精选.docVIP

PINGDINGSHAN UNIVERSITY 毕业论文(设计) 题 目: 图同构的判定 院(系): 数学与信息科学学院 专业年级: 数学与应用数学 2005级 姓 名: 学 号: 指导教师: 04月 2日  PINGDINGSHAN UNIVERSITY Thesis (design) Subject: Isomorphism Judgment of Graphs College: Mathematics and Information Science Major and Grade: Mathematics and Applied Mathematics, Grade 2005 Name: Li Shu-ling No.: Advisor: Master Qu Cong April 2 , 2009  中文摘要 本文对于两图的同构的判定方法进行探讨，通过同构定义、邻接矩阵、关联度序列、出入度序列等方法判定两图同构与否，并给出简单的应用. 关键词 : 图，同构，邻接矩阵，关联度序列，出入度序列. Abstract An interesting problem is to determine whether two graphs are isomorphic. The following is about some ways of the isomorphism definition,the adjacent matrix, the interrelatedness sequence,leaves in-degree sequence to show that two simple graphs are isomorphic or not, and meanwhile gives some simple application. Key words : graphs, isomorphism ，adjacent matrix，the interrelatedness sequence, leaves in-degree sequence . 目 录 中文标题 中文摘要 关键词 英文标题 英文摘要 关键词 正文 ······················································· 1 1图的同构定义 ············································ 1 2图同构判定及简单应用 ·································· 2 2.1用同构定义判定图同构 ······························· 2 2.2用邻接矩阵判定图同构 ······························· 4 2.3用关联度序列法判定同构 ····························· 8 2.4用出入度序列法判定同构 ····························· 10 3用不变量判定两图不同构 ································· 12 参考文献 ··················································· 14 致谢  “图论”是数学的一个分支,它以图为研究对象.图论中的图是由若干给定的点及连接两点的线所构成的图形，这种图形通常用来描述某些事物之间的某种特定关系，用点代表事物，用连接两点的线表示相应两个事物间具有这种关系.图论是一门极有兴趣的学问，其广阔的应用领域涵盖了人类学、计算机科学、化学、环境保护、电信领域等等.严格地讲，图论是组合数学的一个分支，例如，它交叉运用了拓扑学、群论和数论.图论就是研究一些事物及它们之间关系的学科，现实世界中的许多事物能用图来表示其拓扑结构，把实际问题的研究转化为图的研究，利用图论的相关结论对这些问题作分析或判断. 在抽象代数中，同构指的是