我们怎么说两个二元图是同构的? [英] how we say two binary graph's are isomorphism?

问题描述

我们怎么说两个二元图是同构的?输入是一个正则表达式，包含并集，合并和复制(keleene星)三个运算符，二进制数为(0和1')的


请帮助我

how we say two binary graph''s are isomorphism?input is a regular exprssion containing union ,concatination,and repition(keleene star) three opreator''s with binary number''s (0''s and 1''s)


pls help me

推荐答案

在图论中:

如果G1的顶点和G2的顶点之间存在一一对应的关系，则两个图G1和G2是同构的，并且具有以下特性:如果G1的两个顶点相邻，则它们的图像也是如此G2

同构 [

In Graph theory :

Two graphs G1 and G2 are isomorphic if there is a one-to-one correspondence between vertices of G1 and those of G2 with the property that if two vertices of G1 are adjacent then so are their images in G2

Isomorphism[^]

Take a look at the above mentioned link.

BR//
Harsha

更准确的同构定义还应考虑彩色图，有向图或加权图.这样，图的弧与它们的属性之间也应存在一一对应的关系，即顶点和其相邻的弧及其在其他图中的图像与相邻的弧具有相同的关系. (我试图即时生成该短语，如果措辞不太准确，请对不起.)

另请参见: http://en.wikipedia.org/wiki/Graph_theory [

More accurate definition of isomorphism should also take into account colored, directed or weighted graphs. In this way, there should also be a one-to-one correspondence between graph''s arcs and their properties with the property that the vertex and its adjacent arcs and its image in other graphs are in the same relationships with adjacent arcs. (I tried to generate the phrase on the fly, sorry if my phrasing is not so accurate).

See also: http://en.wikipedia.org/wiki/Graph_theory[^] and references.

—SA

这篇关于我们怎么说两个二元图是同构的?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！