isomorphism is a mapping of a graph onto itself, i.e., when G and H are one and the same graph, the isomorphism is called an automorphism of G. Graph...

At the same time, isomorphism for many special classes of graphs can be solved in polynomial time, and in practice graph isomorphism can often be solved...

In graph theory, the Weisfeiler Leman graph isomorphism test is a heuristic test for the existence of an isomorphism between two graphs G and H. It is...

theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle H}...

isomorphisms of the graphs and isomorphisms of their line graphs. Analogues of the Whitney isomorphism theorem have been proven for the line graphs of multigraphs...

is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs. The composition...

in 2017. abstract We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset...

an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if...

from a solution to the graph canonization problem, one could also solve the problem of graph isomorphism: to test whether two graphs G and H are isomorphic...

constitutes a graph isomorphism. Fractional isomorphism is the coarsest of several different relaxations of graph isomorphism. Whereas the graph isomorphism problem...

In graph theory, two graphs G {\displaystyle G} and G ′ {\displaystyle G'} are homeomorphic if there is a graph isomorphism from some subdivision of G...

and the model graph. The case of exact graph matching is known as the graph isomorphism problem. The problem of exact matching of a graph to a part of...

expressive than the Weisfeiler–Leman Graph Isomorphism Test. In practice, this means that there exist different graph structures (e.g., molecules with the...

polynomial of a graph. Easily computable graph invariants are instrumental for fast recognition of graph isomorphism, or rather non-isomorphism, since for...

"Graph isomorphism is in SPP". Information and Computation. 204 (5): 835–852. doi:10.1016/j.ic.2006.02.002. Schöning, Uwe (1988). "Graph isomorphism is...

Isomorphism problem may refer to: graph isomorphism problem group isomorphism problem isomorphism problem of Coxeter groups This disambiguation page lists...

{O}}(n^{1/3})}} , where the length of the input is n. Another example was the graph isomorphism problem, which the best known algorithm from 1982 to 2016 solved in...

two problems: Graph Isomorphism: Is graph G1 isomorphic to graph G2? Subgraph Isomorphism: Is graph G1 isomorphic to a subgraph of graph G2? The Subgraph...

The cycle graph of a group is not uniquely determined up to graph isomorphism; nor does it uniquely determine the group up to group isomorphism. That is...

the exceptional cases of the Whitney graph isomorphism theorem: in general, graphs with isomorphic line graphs are themselves isomorphic, with the exception...

bijection, and its inverse function f −1 is also a graph homomorphism, then f is a graph isomorphism. Covering maps are a special kind of homomorphisms...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

testing whether two graphs are isomorphic. While it solves graph isomorphism on almost all graphs, there are graphs such as all regular graphs that cannot be...

consists of the problems that can be reduced to the graph isomorphism problem. Since graph isomorphism is known to belong both to NP and co-AM, the same...

also graph isomorphism problem). Any planar graph on n nodes has at most 8(n-2) maximal cliques, which implies that the class of planar graphs is a class...

closed formula for the number t(n) of trees with n vertices up to graph isomorphism is known. The first few values of t(n) are 1, 1, 1, 1, 2, 3, 6, 11...

for each size) and the set of unrooted binary plane trees (up to graph isomorphism, with a fixed ordering of the leaves, and with size given by the number...

map any vertex to any other vertex. In the context of graph enumeration and graph isomorphism it is important to distinguish between labeled vertices...

questions to ask Peggy. He can either ask her to show the isomorphism between H and G (see graph isomorphism problem), or he can ask her to show a Hamiltonian...

isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups. The isomorphism problem...