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

  • Thread starter Thread starter delc1
  • Start date Start date
  • Tags 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.
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: 79
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)?
 

Similar threads

MHB Graph Grammer Function For Two Exotic Graphs Question please.
Replies
4
Views
2K
MHB Graphs with N Nodes: Proving Cliques and Anti-Cliques
Replies
6
Views
3K
I Find Smallest Subtree of G w/ Nodes from S
Replies
5
Views
2K
MHB Number of Walks in K5 of Length 2: 15
Replies
6
Views
3K
MHB Bipartite Graphs: Does $\alpha(G) =|U|$?
Replies
1
Views
2K
Python Help solving a geometrical matching issue with Graph Neural Networks
Replies
1
Views
2K
MHB Understanding Two Graph Theory Problems
Replies
2
Views
2K
MHB Finding the shortest Hamiltonian cycle in a complete graph
Replies
2
Views
2K
I Traffic simulation : directed graph including specific rules
Replies
5
Views
2K
MHB Girth of $H_d$ Hypercube Graph: Proving $4$ by Induction
Replies
5
Views
3K

Hot Threads

Recent Insights

Back
Top