70.4k views
3 votes
HELP!!!

The image shown here is a floor-plan of a house.

Make a vertex-edge graph of this floor-plan, where each letter is a vertex and each doorway is an edge.

It is possible to take a tour of the house so that you walk through each doorway only once and finish at your starting point.


True
False

HELP!!! The image shown here is a floor-plan of a house. Make a vertex-edge graph-example-1
User Milaniez
by
4.7k points

1 Answer

4 votes
True! You can start at A and go to B, D, E, F, and then go out the side door of C.
User Rspencer
by
5.0k points