The acquirement of the Luster decomposition method of the symbolic network function for large scale network

It is reported that at present the solution for the symbolic network function of the networks by computer can only handle the small network with about a dozen nodes. This paper specially deals with the solution of the relatively large scale networks. First to solve for the indefinite admittance matrix, and then solve for the corresponding Coates graph G, and decompose G into several small scale subgraphs, so as to analyze the individual subgraphs. After solving for the K hyperconnection set, combine them together according to a certain rule, so that the symbolic network function of the large scale network can be obtained