摘要
本文旨在证明Coates图的两个消去定理,正如文献[1]中所表明的那样,把图论技术用到计算方法上是卓有成效的。本文采用文献[2]中的一切符号与术语,只是各有向边的重量不必一定是数,可以是任意环(如多项式)之元,我们的讨论从推广文献[2]中定义3.2关于1-因子的概念开始。
Let I={i_(k)|k=1,2,…,s}be a set of nodes(edges)of graph G.We defined a 1-subfactor concerning I as a set of disjoint directed circuits connected with all the nodes(edges)in I,every one in which is at least connected with(having)one node(edge)in I.Two theorems have been obtained.Some special cases have been previously worked out by several authors.
出处
《科学通报》
1979年第21期966-968,共3页
Chinese Science Bulletin
