| This thesis has investigated the spread of the problem of network flows over fuzzy circle matroids based on the existed theory, such as some properties and conclusion of fuzzy matroid, fuzzy graph matriod and closed regular matroids。The content are as follows aspect:1. The define of max flows and feasible flows which in a circle of graph without favor in graph theory have analyzed, simultaneously, we also have discussed the problem of max flows pass by one side in the things as a graph exist more circle。2. Base on the things as the analyzed with network flows are all provided with fuzzy property, we imported the conception of fuzzy degree。Subsequently, fuzzy flow, fuzzy max flux and feasible fuzzy flows have analyzed and defined in the fuzzy graph and fuzzy matroid。3. Make using of the defining and analyzing above, we have ulteriorly investigated the properties of the problem of network in fuzzy circle matroids, have aslo proved several define and theory。Simultaneously, we have also illustrated the reason of which the theorem of max-flow-min-cut not always come into existence of the problem of network in fuzzy circle matroids。4. This thesis has also proven a fuzzy circle matroids which has max-flow-min-cut characteristic have the length-wide inequality characteristic, and also have given an example to explanation。Network flow theory takes important role in operational research。and the theory of max-flow-min-cut is an important theorem in network flow theory。A lot of problems in orperational research and combinatorics all could come down to the problem of network flow。The spread of the theory of max-flow-min-cut in network flow over matroid have solved, the theory of operational will be developed if we can investigate the problem of network flow of fuzzy matroids。at the same time,the area of investigation of fuzzy matroids theory will also be enlarged and enriched, the proposed results and adopted approaches provide a series of valuable sources for the further research and application of fuzzy matroids theory。... |