MHB Which Nodes Are Reachable in a Walk of Length 4?

  • Thread starter Thread starter delc1
  • Start date Start date
  • Tags Tags
    Graphs
delc1
Messages
9
Reaction score
0
Hi all

Could anyone help with this question. Any help is appreciated!

View attachment 2498
 

Attachments

  • image.jpg
    image.jpg
    34.9 KB · Views: 78
Physics news on Phys.org
Hint #1: 30 is an even number.

Hint #2: which vertices (nodes) can you reach in a walk of length 2? From those vertices (there are 3), which ones can be reached from them in another walk of length 2 (making a walk of length 4 from our start)?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top