Project Links Logo Artwork
Graph Theory: Industrial Drilling
Home > Graph Theory: Industrial Drilling > Foundations > Walks, Paths, Cycles
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Walks, Paths, Cycles

Problem 15:

Find a walk in the graph which contains all the vertices of the graph.



Figure 14:





Answer

Problem 16:

Find a walk from vertex to vertex which does not repeat any vertex.

Answer

Problem 17:

Which of the below graphs is connected and which is not? Find all connected components of each graph.



Figure 15:







Figure 16:





Answer

 
 
go backgo forward
go backgo forward