| 有向图是极大弧连通的充分条件 |
| |
| 引用本文： | 徐兰.有向图是极大弧连通的充分条件[J].成都大学学报(自然科学版),2010,29(4):301-303,314. |
| |
| 作者姓名： | 徐兰 |
| |
| 作者单位： | 昌吉学院,数学系,新疆,昌吉,831100 |
| |
| 摘 要： | 设D是一个n阶强连通的有向图.D的逆度定义为,R(D)=∑v∈V(D)max{1/(d+(v)),1/(d-(v))},其中,d+(v)与d-(v)是v的出度和入度.证明了,如果R(D)<2+2/(δ(δ+1))+(n-2δ)/((n-δ-2)(n-δ-1)),其中,δ(D)=min{d+(v),d-(v),v∈V(D)},是最小度,那么,D是极大弧连通的.同时,给出了一个二部图的类似结果.
|
| 关 键 词： | 有向图 逆度 极大弧连通 |
Digraphs Are Sufficient Conditions for Maximum Arc Connected |
| |
| XU Lan.Digraphs Are Sufficient Conditions for Maximum Arc Connected[J].Journal of Chengdu University (Natural Science),2010,29(4):301-303,314. |
| |
| Authors: | XU Lan |
| |
| Institution: | XU Lan(Department of Mathematics,Changji College,Changji 831102,China) |
| |
| Abstract: | Let D be an n-order strongly connected digraphs.The inverse degree of D is defined by R（D）=∑v∈V（D）max{1/（d^＋（v））,1/（d^-（v））} where d^＋（v） and d^-（v） is in-degree and out-degree of v respectively.If R（D）〈2＋2/δ（δ＋1）＋n-2δ/（n-δ-2）（n-δ-1） is testified where δ（D）=min{d^＋（v）,d^-（v）,v∈V（D）} is the minimum degree,then D is maximally arc-connected.Analogous results for bipartite digraphs were given. |
| |
| Keywords: | digraphs inverse degree maximally edge connected |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
