Even cycle problem in connection with fault analysis

In connection with the more widely applicable sufficient condition for parameter-value determinability of analog circuits, the authors deal with a graph-theoretic problem of finding even cycles of particular types in a graph. The problem is the key for developing a more widely applicable sufficient condition for the unique restorability based upon using identities of edge-admittances, which may be induced at each step of the use of the generalized star-to-polygon transformation. Algorithms for solving the problem are given