20070317, 00:26  #1 
Mar 2007
3 Posts 
determine
hello
pleaase help me in this question thanx Determine the number of paths of length n between any two adjacent vertices in K3,3 , for all n ≥ 0. 
20070611, 16:29  #2 
∂^{2}ω=0
Sep 2002
República de California
2^{2}×3×7×139 Posts 
Please define "K3,3".

20070612, 15:21  #3 
"Robert Gerbicz"
Oct 2005
Hungary
2·3·11·23 Posts 

20070612, 19:35  #4 
"Lucan"
Dec 2006
England
2×3×13×83 Posts 
I assume a "path" doesn't pass through any vertex more than once.
Then there is one path of length 1, four paths of length 3 and four of length 5. But perhaps the restriction is not using an edge more than once. (Eulerian? Hamiltonian? I forget) 
20070612, 23:01  #5 
"Lucan"
Dec 2006
England
194A_{16} Posts 
I may have contravened "Rool 2" of homework help here,
but I presume enough time has elapsed to excuse it! 
20070612, 23:11  #6  
∂^{2}ω=0
Sep 2002
República de California
11676_{10} Posts 
Quote:
(And if you think that's a tad harsh, you should see what we do to people who crib homework from each other.) 

20070613, 03:38  #7  
Aug 2002
8356_{10} Posts 
Quote:


20070617, 06:01  #8 
Feb 2007
2^{4}·3^{3} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Determine squares  fenderbender  Math  14  20070728 23:24 
Methods to determine integer multiples  dsouza123  Math  6  20061118 16:10 
Help: trying to determine latency on movaps instructions on AthlonXP  LoKI.GuZ  Hardware  1  20040126 20:05 
Early doublechecking to determine errorprone machines?  GP2  Data  13  20031115 06:59 
How to determine the P1 boundaries?  Boulder  Software  2  20030820 11:55 