Computer Science, asked by mdm276243, 8 months ago

Can a single dot (.) be a graph? Justify your answer with proper
example.

Answers

Answered by sankarjitdutta1970
1

Explanation:

Question 1

Question 1Unfortunately no. You can do this by trial and error on Figure 3. But it will help to alter Figure 3 slightly in the following way. Put a dot on every land mass and join two dots by a line for each bridge that connects them. So we get Figure A1 below. And then it would help to think a little more deeply than trial and error.

Question 1Unfortunately no. You can do this by trial and error on Figure 3. But it will help to alter Figure 3 slightly in the following way. Put a dot on every land mass and join two dots by a line for each bridge that connects them. So we get Figure A1 below. And then it would help to think a little more deeply than trial and error.Konigsberg reduced to dots and lines

Question 1Unfortunately no. You can do this by trial and error on Figure 3. But it will help to alter Figure 3 slightly in the following way. Put a dot on every land mass and join two dots by a line for each bridge that connects them. So we get Figure A1 below. And then it would help to think a little more deeply than trial and error.Konigsberg reduced to dots and linesFigure A1: Königsberg reduced to dots and lines

Question 1Unfortunately no. You can do this by trial and error on Figure 3. But it will help to alter Figure 3 slightly in the following way. Put a dot on every land mass and join two dots by a line for each bridge that connects them. So we get Figure A1 below. And then it would help to think a little more deeply than trial and error.Konigsberg reduced to dots and linesFigure A1: Königsberg reduced to dots and linesSuppose that you could do the round trip walk. And suppose that you started at land mass A. Then you would have to go out from A on a bridge. So you start by using one bridge. At any time later that you came back to A you would use one bridge going in to A and one edge going out. So far you have used an odd number of bridges. Eventually you'll go back to A and use one final bridge to make the bridge count even. BUT! No land mass is attached to an even number of bridges. SO! There is no round trip walk.

Similar questions