2 is not the reason for simple graphics. Suppose the graph is a simple graph, and there are two vertices with degree 5 in the title, each vertex with degree 5 is connected with the other five vertices, and the degrees of the remaining four vertices with non-degree 5 must be greater than 2, which contradicts the vertices with degree 1 in the title. You can draw a graph, but it is not a simple graph, it is a graph with a self-loop or two sides.