华东师范大学学报(自然科学版) ›› 2010, Vol. 2010 ›› Issue (6): 142-145,.

• 应用数学与基础数学 • 上一篇    下一篇

一类变换图的同构问题

顾秀松1, 徐丹丹1, 孙志人2, 姚泽清1   

  1. 1. 解放军理工大学 理学院, 南京 211101; 2. 南京师范大学 数学科学学院, 南京 210046
  • 收稿日期:2009-12-01 修回日期:2010-03-01 出版日期:2010-11-25 发布日期:2010-11-25
  • 通讯作者: 顾秀松

Isomorphism of transformation graph

GU Xiu-song 1, XU Dan-dan 1, SUN Zhi-ren 2, YAO Ze-qing 1   

  1. 1. Institute of Science, PLA University of Science and Technology, Nanjing 211101, China; 2. School of Mathematical Science, Nanjing Normal University, Nanjing 210046, China
  • Received:2009-12-01 Revised:2010-03-01 Online:2010-11-25 Published:2010-11-25
  • Contact: GU Xiu-song

PDF

1317

摘要： 利用度序列的概念, 证明变换图G--+与Hn--+同构, 当且仅当G与Hn同构. 以及在G连通的条件下,G--+与Cn--+同构,当且仅当G与Cn同构.

关键词: 变换图, 同构, 度序列, 度数, 变换图, 同构, 度序列, 度数

Abstract: By the method of degree sequence, It was shown that G--+ is isomorphic to Hn--+ if and only if G is isomorphic to Hn. It was also shown that for a grap G, when G is connected, then G--+ and Cn--+ are isomorphic if and only if G and Cn are isomorphic.

Key words: isomorphism, degree sequence, vertex degree, transformation graph, isomorphism, degree sequence, vertex degree

中图分类号: