グラフ同型
1. Graph isomorphismIn graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly called "edge-preserving bijection", in accordance with the general notion of isomorphism being a structure-preserving bijection. In the above definition, graphs are understood to be undirected non-labeled non-weighted graphs.
Read “Graph isomorphism” on English Wikipedia
Read “グラフ同型” on Japanese Wikipedia
Read “Graph isomorphism” on DBpedia
Read “Graph isomorphism” on English Wikipedia
Read “グラフ同型” on Japanese Wikipedia
Read “Graph isomorphism” on DBpedia
Discussions
Log in to talk about this word.