Verification Method for Graph Isomorphism Criteria

TL;DR

This paper introduces a verification method for graph isomorphism criteria that ensures correctness and reduces backtracking by subdividing candidate spaces, improving the reliability of isomorphism determination.

Contribution

It proposes a verification approach for existing isomorphism criteria and a subdivision method to enhance decision accuracy and efficiency.

Findings

The verification method accurately assesses the sufficiency and necessity of isomorphism criteria.

The subdivision method reduces backtracking space in graph isomorphism algorithms.

The approach improves the reliability of graph isomorphism decision processes.

Abstract

The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide candidate spaces. The sufficient conditions are used to rebuild the isomorphic reconstruction of special graphs, but their drawback is that the isomorphic functions of subgraphs may not form part of the isomorphic functions of the parent graph. The use of sufficient or necessary conditions generally results in backtracking to ensure the correctness of the decision algorithm. The sufficient and necessary conditions can ensure that the determination of graph isomorphism does not require backtracking, but the correctness of its proof process is difficult to guarantee. This article proposes a verification method that can correctly determine whether the judgment conditions proposed by previous researchers are sufficient and necessary conditions. A subdivision method has also been proposed in this article, which can obtain more subdivisions for necessary conditions and effectively reduce the size of backtracking space.