吉首大学学报(自然科学版)

• 数学 • 上一篇    下一篇

满足Ore-型条件图的最小边数

郝琛, 杨卫华   

  1. (1.晋中职业技术学院电子信息工程学院,山西 晋中 030600;2.太原理工大学数学学院,山西 太原 030024)
  • 出版日期:2019-09-25 发布日期:2019-11-12

Minimum Size of Graphs Satisfying Ore Condition

HAO Chen, YANG Weihua   

  1. (1. School of Electronic Information Engineering, Jinzhong Vocational & Technical College,Jinzhong 030600, Shanxi China; 2. Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, China)
  • Online:2019-09-25 Published:2019-11-12
  • About author:HAO Chen (1983-), was born in Yangquan City, Shanxi Province, female, master, lecturer of Jinzhong Vocational & Technical College; reaserch area is graph theory.
  • Supported by:

    National Science Foundation of China (11671296); Shanxi Scholarship Council of China and Program for the Innovative Talents of Higher Learning Institutions of Shanxi

摘要:

在给定参数下确定极值图,是极值图论中的经典研究思想.讨论了基于Ore-条件下的极值图,并对一般的Ore-型条件下图的最少边数给出了部分结论.

关键词: Ore-条件, 极值图, 图的最少边数

Abstract:

Determining the extremal graph under a given parameter is a classic topic in extremal graph theory. We determine the minimum size of graphs satisfying Ore condition and  obtain a partial result for the minimum size of graphs satisfying Ore-type condition

Key words: Ore condition, extremal graph, minimum size of graphs

公众号 电子书橱 超星期刊 手机浏览 在线QQ