how we say two binary graph's are isomorphism?

Question

3.00/5 (1 vote)

See more:

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

Posted 19-May-11 2:06am

jalandhar singh

Updated 19-May-11 2:50am

Richard MacCutchan

v2

Add a Solution

Comments

Richard MacCutchan 19-May-11 8:50am

I think you may need to clarify your problem description.

Sergey Alexandrovich Kryukov 19-May-11 15:33pm

Well, regular expression, etc., sound like a complete gibberish (I don't hope for clarification; I think this is just a mess).
As to isomorphic graphs, please see my answer and the other one.
--SA

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

*ZeeroC00l* · Answer 1 · 2011-05-19T03:00:00

Solution 1

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

Posted 19-May-11 3:00am

ZeeroC00l

Comments

Sergey Alexandrovich Kryukov 19-May-11 15:32pm

Basically correct (my 5), but needs generalization for wider class of graphs.
Please see my answer.
--SA

ZeeroC00l 19-May-11 17:27pm

Yes, you are right. What I gave was just the basic idea of how you define an isomorphism b/w two graphs.

Sergey Alexandrovich Kryukov 20-May-11 23:14pm

Sure.
--SA

Sergey Alexandrovich Kryukov · Answer 2 · 2011-05-19T09:31:00

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