Forum OpenACS Q&A: Theory of Graphs

Collapse
1: Theory of Graphs
Posted by Iuri Sampaio on 09/07/07 01:47 AM
This thread is to students, teachers, curious people,...
all the people interested in Computer Sciences, particulary theory of graphs.

Is there a bipartite graph, {G(m,n)/ m,n>0} that is not isomorphic to any subgraph of K-cube graph category, K>0 ?

If so, which one is it? does anyone have good sources to start my search?

thanks in advance,

Collapse
2: Re: Theory of Graphs (response to 1)
Posted by Tom Jackson on 09/07/07 02:24 AM
Do you mean like a GPS coordinate?

I do know that the knowledge required to construct a question which has meaning is isomorphic with the knowledge of where to start looking for the answer.

Collapse
3: Re: Theory of Graphs (response to 2)
Posted by Iuri Sampaio on 09/07/07 08:56 AM
yes, you can abstract it to GPS coordinates.
I am looking an answer to prove such example, then i can consider it as a rule, a theorem, to use it whatever field i need.
Collapse
4: Re: Theory of Graphs (response to 3)
Posted by Tom Jackson on 09/07/07 04:38 PM
If you are interested in coding theory, like compression, the best skinny on the subject is here:

http://www.bmsc.washington.edu/people/merritt/text/y_coding.txt

I think you can find the yabba dabba do (y coding) software if you look hard enough.

For those with a few minutes to waste, some definitions are hre:

http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyGraphTheory/defEx.htm