含有两个非临界点的强连通定向图的弧数.pdfVIP

2011年 9月 运 筹学 学 报 第 15卷 第 3期 Sept．，2011 OperationsResearch Transactions V01．15 NO．3 TheNumberofArcsofStrongly Connected Oriented Graphswith TwoNoncriticalVertices LIN Shangwei十 LIChunfang WANG Shiying AbstractItisprovedthatastronglyconnectedorientedgraphD withn≥ 4vertices andatleastf” 1+3arcshastwodistinctverticesU ，V suchthatbothD一乱 and D — V arestrongly connected．Theexamplesshow thattheabovelowerbound onthe numberofarcsissharp． Keywordsdigraph，stronglyconnectedsubdigraph，criticalvertex ChineseLibrary Classification O157．5 2010MathematicsSubjectClassification05C40 含有两个非临界点的强连通定向图的弧数 林上为 t 李春芳 王世英 摘要证明顶点数为 n≥4，弧数为m ≥(“i)+3的强连通定向图D中存在两点u、 V，使得 D—u 和 D—V 都是强连通的，并用例子说明这里所给的关于弧数的下界是紧 的． 关键词 有向图，强连通子图，临界点 中图分类号 O157．5 数学分类号 05C40 1 Term inology and introduction Forgraph—theoreticalterminologyandnotationnotdefinedherewefollow 1【]．We onlyconsiderfinite(di)graphswithoutloopsandmultipleedges(arcs)．AdigraphH isa subdigraphofadigraphD (writtenH D)ifV(H) (D)，A(H) A(D)andeveryarc inA(H)hasbothend—verticesin (日)．WhenH C—DbutH ≠D，wecallH aproper subdigraphofD．AspanningsubdigraphofD isasubdigraphH withV(H)= (D)． SupposethatU isanonemptysubsetofV=V(D1．ThesubdigraphofD whosevertex setiSU andwhosearcsetisthesetofthosearcsofD thathavebothend—verticesinU iS calledthesubdigraphofDinducedbyUandisdenotedbyD[U]；wesaythatD[U】isan inducedsubdigraphofD．Theinducedsubdigrapha[y＼U]iSdenotedbyD— ；itiSthe 收稿 日期： 2011年 8月 13日． SupportedbytheNationalNaturalScienceFoundationofChinafNo61070229)andthe NaturalScienceFoundationforYoungScientistsofShanxiProvince(No．2011021004)． 1．SchoolofMathematicalSciences，ShanxiUniversity，Taiyuan030006，China；山西大学数学科学学院， 太原 030006 十通讯作者 Correspondingauthor 58