Graph isomorphism

（重定向自Isomorphic graph）

In 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 described as "edge-preserving bijection", in accordance with the general notion of isomorphism being a structure-preserving bijection.

单词	Isomorphic graph
释义	Isomorphic graph 英语百科 Graph isomorphism （重定向自Isomorphic graph） In 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 described as "edge-preserving bijection", in accordance with the general notion of isomorphism being a structure-preserving bijection.
随便看	Data rates data rate to bandwidth ratio data reaction system data reader data read error data reading system data readout data readout setup data read path data ready data ready flag data realm data rearrangement data reasonableness test data recall data receive exchange data receiver data recognition data reconciliation data reconstitution datareconstruction data reconstruction data record data record apparatus data record clause