非极大弧连通定向图弧连通度的下界  

Lower Bounds on the Arc-connectivityof Non-maximal Arc-connected Oriented Graphs

作　　者：王晓丽[1] 张雪霞 WANG Xiao-li;ZHANG Xue-xia(School of Mathematics,Jinzhong University,Jinzhong 030619,Shanxi,China)

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

出　　处：《兰州文理学院学报（自然科学版）》2021年第3期27-30,共4页Journal of Lanzhou University of Arts and Science(Natural Sciences)

基　　金：晋中学院博士基金科研项目(bsjj2016202);晋中学院教学改革与研究项目(Jg201920);山西省高校教学改革创新项目(J2020318)。

摘　　要：有向图的弧连通度是图论中非常重要的概念之一.利用函数的凸性来研究定向图的弧连通度,考虑定向图在给定团数目条件的情况下,将Turán定理的结论推广到定向图,给出了非极大弧连通定向图弧连通度的下界.The arc-connectivity of directed graph is one of the most important concepts in graph theory.In this paper,the convexity of functions is applied to study the arc-connectivity of oriented graphs,and the condition of given number of clique in oriented graphs is considered,the results of Turán Theorem are extended to oriented graphs,and the lower bound of the degree of arc-connectivity of non-maximal arc-connected oriented graphs is given.

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

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