Vertex prime number degree-based single-switch direct-current converter non-isomorphic graph construction method

Abstract

The invention discloses a vertex prime degree-based single-switch direct-current converter non-isomorphic graph construction method. The method comprises the steps of giving the number of vertexes, edge types and the number of each edge type of a converter topological graph; converting the comprehensive influence of the edge number and the edge type of vertex connection on the converter structureinto vertex prime number degrees; screening the vertexes by using screening conditions of vertexes with different prime numbers and screening conditions of vertexes with the same prime number but adjacent vertexes with different prime numbers, and constructing new edges from the screened vertexes; screening the edges by using screening conditions in the newly formed edge non-existence graph, and adding the screened edges into the graph; and circulating the process by applying the newly added screening condition with the non-last side to obtain the non-isomorphic graph of all topologies of theconverter. The method can be used for constructing the non-isomorphic graph of all topologies of the converter with the given side type and the number of each side type, and can be applied to topologyinitialization search of the programmable direct-current converter, so that the algorithm operation efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of power electronics topology design, in particular to a method for constructing a non-isomorphic graph of a single-switch DC converter based on the vertex prime degree. Background technique [0002] Non-isomorphic graphs are graphs with the same structural parameters (number of vertices, edge types, and number of each edge type), but the connections of edges are not the same. It has wide application value in network topology design, computer vision processing, pattern recognition and other fields. [0003] The problem of non-isomorphic graphs is one of many difficult problems in graph theory. At present, most of the research is aimed at the identification methods of non-isomorphic graphs, mainly including: vertex order exchange method, vertex degree sequence method, and search-based algorithms. These methods study the judgment of graphs from different angles, and can reflect their respective advantages in ...

AI Technical Summary

Problems solved by technology

But at the same time, there are also shortcomings, either the method can only be judged for the licensed graph, or the method is slow to judge

Moreover, the above-mentioned methods are for discriminating non-isomorphic graphs for a given graph, and cannot realize the construction of non-isomorphic graphs. Therefore, it is necessary to propose a method for constructing non-isomorphic graphs.

Images