满足Ore-型条件图的最小边数OA
Minimum Size of Graphs Satisfying Ore Condition
在给定参数下确定极值图,是极值图论中的经典研究思想.讨论了基于Ore-条件下的极值图,并对一般的Ore-型条件下图的最少边数给出了部分结论.
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
郝琛;杨卫华
晋中职业技术学院电子信息工程学院,山西晋中030600太原理工大学数学学院,山西太原030024
数理科学
Ore-条件极值图图的最少边数
Ore conditionextremal graphminimum size of graphs
《吉首大学学报（自然科学版）》 2019 (5)
10-12,17,4
National Science Foundation of China (11671296)Shanxi Scholarship Council of China and Program for the Innovative Talents of Higher Learning Institutions of Shanxi
评论