Is it possible to construct a graph with 1 vertex having a degree two.
Yes
No
Answers
Answered by
0
Answer:
No is the answer.
Suppose 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.
Answered by
0
Answer:
sparkle Disc sick aisa aerial aerial aerial aerial aapaki sick sick sick sick sick sick ap aj sooraj
Similar questions