| 摘要: |
| 考虑经典Turán型问题的变形,并确定e(F6,n)=4n+2,其中F6是6个顶点的扇图,n充分大. |
| 关键词: 图 扇图 度序列 |
| DOI： |
| 投稿时间：2009-02-03 |
| 基金项目:宁夏高校科学研究项目,宁夏大学科研基金(项目编号:ZR200827)资助。 |
|
| An Extremal Problem on Potentially F6-graphic Sequences |
|
CHEN Gang
|
| (College of Mathematics and Computer, Ningxia University, Yinchuan, Ningxia, 750021, China) |
| Abstract: |
| A variation of the classical Turán-type extremal problem is considered, and the value of e(F6, n)=4n+2 is determined, where F6 is a fan graph on 6 vertices and n is large sufficiently. |
| Key words: graph fan graph degree sequence |
