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

Thread starter delc1
Start date May 18, 2014
Tags

Graphs

AI Thread Summary

In the discussion about reachable nodes in a walk of length 4, the initial hint emphasizes that 30 is an even number. Participants are encouraged to first identify which vertices can be reached in a walk of length 2. From those identified vertices, the next step is to determine which can be reached again in another walk of length 2, effectively creating a total walk of length 4. This methodical approach is crucial for solving the problem accurately. Understanding the relationships between nodes is key to determining their reachability within the specified walk length.

May 18, 2014

delc1

Hi all

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

View attachment 2498

Physics news on Phys.org

May 18, 2014

Deveno

Science Advisor

Gold Member

MHB

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)?

Thread 'Formal derivation of statement from Peano Arithmetic system'

I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...

View full post »