What does an illustrated undirected graph with only 1 endpoint look like?

Question

How do you illustrate an undirected graph 4 nodes/vertexes, but have them all connected? If you divide the nodes (at any of the nodes of the graph) into two subsets, how would that work or look like?

I tried drawing the undirected graph in C formations, but if the the graph at one of the nodes was divided, another node would end up completely disconnected.

What do you mean by "endpoint"? – ravenspoint Dec 07 '22 at 20:18 — ravenspoint, Dec 07 '22 at 20:18

ravenspoint · Answer 1 · 2022-12-07T20:18:28.613

0

4 node undirected graph with all nodes connected by one hop

Divided into two subsets

edited Dec 07 '22 at 20:18

answered Dec 07 '22 at 20:11

ravenspoint

19,093
6
57
103

What does an illustrated undirected graph with only 1 endpoint look like?

1 Answers1