期刊文献+

只有两对顶点的度分别相等的图序列

On the graphic sequences which only the degree of two for point is respectively equal
下载PDF
导出
摘要 只有两对顶点的度分别相等的图序列称为G(2,2)图序列.以Erdǒs-Gallai定理为基础,采用分段的方法讨论了G(2,2)图序列,得到非负整数不增序列d=(d_1,d_2,…,d_n)为G(2,2)图序列的充要条件. On the graphic sequences which only the degree of two for point is respectively equal is said a graphic sequence of G(2, 2). This paper, based on Erdǒs-Gallai theorem, has discussed picture sequence for foundation with the method of section. It discussed the graphic sequence of G(2, 2) and obtaind a sufficient and necessary condition.
出处 《华中师范大学学报(自然科学版)》 CAS CSCD 北大核心 2011年第2期186-188,共3页 Journal of Central China Normal University:Natural Sciences
基金 国家自然科学基金项目(10671089)
关键词 图序列 G(2 2)图序列 degree graphic sequencel graphic sequence of G(2, 2)
  • 相关文献

参考文献3

二级参考文献5

  • 1Bollobas B. Extremal Graph Theory[M]. London: The Ac ademic Press Inc, 1978.
  • 2Bondy J A, Murty U S R. Graph Theory with Applications [M]. London: The Macmillan Press Inc, 1976.
  • 3Behead M, chartarand G. No graph is perfect Amer[J]. Math Monthly, 1967 ,74:962-963.
  • 4Hutchinson J P. When three people shake the same numbers of hands an exercise of degree sequences[J]. Congressus Numerantium, 1993,95 : 31-35.
  • 5Chen G, Piotrowski W, Shreve W. Degree sequences with single repetitions[J]. Congressus Numer-antium, 1995,106.. 27-32.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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