Question 1161178
.


You need to have a connected graph with no repeating vertices.


The only correct answer is B.


-------------


The answer by @131423324  is wrong.


The short characteristic to person  @131423324:


<pre>
    Submitted 3 (three) posts for now.

    In two of them he simply re-wrote from @josgarithmetic;

    his third post is here and is INCORRECT.

    WEB-site, which he announced as "his" in his self-description, does not work.
</pre>

Should I add something/anything to it ?


---------------


Hey, &nbsp;@131423324, &nbsp;at this forum &nbsp;WE &nbsp;DO &nbsp;NOT &nbsp;NEED &nbsp;such &nbsp;"tutors" . . .