期刊文献+

一类变换图的同构问题

Isomorphism of transformation graph
下载PDF
导出
摘要 利用度序列的概念,证明变换图G^(--+)与H_n^(--+)同构,当且仅当G与_n同构.以及在G连通的条件下,G^(--+)与C_n^(--+)同构,当且仅当G与_n同构. By the method of degree sequence,It was shown that G^(--+) is isomorphic to H_n^(--+) if and only if G is isomorphic to H_n.It was also shown that for a grap G,when G is connected,then G^(--+) and C_n^(--+) are isomorphic if and only if G and C_n are isomorphic.
出处 《华东师范大学学报(自然科学版)》 CAS CSCD 北大核心 2010年第6期142-145,168,共5页 Journal of East China Normal University(Natural Science)
基金 国家自然科学基金(70571087)
关键词 变换图 同构 度序列 度数 transformation graph isomorphism degree sequence vertex degree
  • 相关文献

参考文献3

二级参考文献15

  • 1林祺,束金龙.变换图的正则性和谱半径[J].运筹学学报,2007,11(1):102-110. 被引量:7
  • 2[1]Bondy J A, Murty M R. Graph theory and Its Application, Academic Press, 1976
  • 3[2]Ales J, Bacik R. Strong elimination orderings of the total graph of a tree, Discrete Appl. Math. 1992, 39:293~295
  • 4[3]Baur D, Tindell R. The connectivity of line graphs and total graphs, J. Graph Theory 1982, 6:197~204
  • 5[4]Behzad M. Graphs and their chromatic numbers, Ph.D. thesis, Michigan State University, 1965
  • 6[5]Behzad M, Chartrand G. Proc. Edinburgh Math. Soc. 1966/67, 15:117~120
  • 7[6]Iqbalunnisa T, Janakiraman N, Srinivasan N. Note on iteralted total graphs, J. Indian Math. Soc. New Ser. 1990, 55:67~71
  • 8[7]Gudagudi B R, Stewart M J. On n-th subdivision graphs, J. Karmatak Univ. Sci. 1974, 19:282~288
  • 9[8]Van Rooij A C M, Wilf H S. The interchange graph of a finite graph, Acta Mate. Acad. Sci. Hungar. 1965, 16:163~169
  • 10Boesch F.Synthesis of reliable networks-a survey[J].IEEE Transactions on Reliability,1986,35:240-246.

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部