定向图极大弧连通的度序列条件  

Degree Sequence Conditions for Maximally Arc - connected Oriented Graphs

作　　者：王晓丽[1] WANG Xiao-li(Department of Mathematics,Jinzhong University,Jinzhong Shanxi,030619,China)

机构地区：[1]晋中学院数学系,山西晋中030619

出　　处：《晋中学院学报》2021年第3期1-3,共3页Journal of Jinzhong University

基　　金：晋中学院博士基金科研项目“网络联通性的优化研究”(bsjj2016202);晋中学院教学改革与研究项目“课程思政视野下《数学分析》课程教学改革探讨”(Jg201920);山西省高校教学改革创新项目“融入课程思政的高等数学课程混合式教学”(J2020318)。

摘　　要：利用连续凸函数的性质来研究定向图的极大弧连通度,当定向图的团数ω(D)≤r的情况下,把无向图的Turán定理推广到定向图,给出了定向图极大弧连通的度序列条件.The maximally arc-connected oriented graphs is studied by using the properties of continuous convex functions.When the clique number of a oriented graph isω(D)≤r by extending the turán theorem of undirected graphs to oriented graphs,we present degree sequence conditions for maximally arc-connected Oriented Graphs.

关 键 词：凸函数 弧连通度 定向图 度序列 

分 类 号：O157[理学—数学]