摘要
设G(V ,E)是 2 -边连通无向简单图 ,D(V ,A)是G的一个定向图 ,A(D)为D的弧集 .若映射 f:A(D)→ {… ,-n ,- (n - 1) ,… ,- 1,0 ,1,… ,n ,… }满足 u∈V(D)有 f+ (u) =f-(u) ,则称 D ,f 为一流图 .其中 f+ (u) = vu∈A(D) f(vu) ,f-(u) = uv∈A(D) f(uv) .对 a∈A(D) ,当 f(a)≠ 0时 ,称 D ,f 为非零流图 .对非零流图 D ,f ,称所有 ｜f(a) ｜和的最小值的流 f为D的最小流 .本文研究
For a 2-edge connected graph G(V,E),the notation D(V,A)denotes the oriented graph of graph G(V,E).f is a map f:A(D)→｛…,-n,-(n-1),…,-1,0,1,…,n,…｝satisfies f +(u)=f -(u).Where f +(u)=vu∈A(D)f(vu),f -(u)=uv∈A(D)f(uv).We use notation ?D,f? to denote such oriented graph D(V,A) and map f, and call it a flow graph.A ?D,f? which the map f satisfies f(a)≠0 for every oriented edge a∈A(D) is called a no-zero flow graph. A map f which the no-zero graph ?D,f? is called the minimum flow of D. In this paper,we study some problems about such flow f as above.
出处
《兰州铁道学院学报》
2000年第4期39-41,共3页
Journal of Lanzhou Railway University
基金
国家自然科学基金资助课题! (No .198710 3 6)
