disjoint

It is proved that for anykverticesv1,v2,…vkinG,there exist vertex-disjoint pathsP1,P2,…Pksuch that |V(Pi)|=aiandviis a endvertex ofPifor 1 i k.

令|V(G)|=n=k∑i=1ai,ai 6,1 i k,并且σ2(G)n+k-1,证明了对于图G中任意的k个顶点v1,v2,…vk,都存在点不相交[的]路P1,P2,…Pk,使得对于1 i k,都有|V(Pi)|=ai并且vi是路Pi的一个端点。

In this paper, an algebraic method for the design of digital multiplexer tree-type networks based on disjoint reduced sum-of-products forms of logic functions is presented by using principle realizing any logic function with multiplexer network and Boolean algebraic operations.

利用多路选择器网络可以实现任意逻辑函数的原理和布尔代数运算,提出了基于逻辑函数不相交[的]简化的积之和形式的数字多路选择器树形网络设计的一种代数方法,该方法可以使待设计的数字多路选择器网络化简到最小树形网络。