Correct definition of Regular graph.

Choose the Cubic graph.

$$\sum_{v\epsilon V}^{ }\ \deg\left(v\right)=\frac{1}{2}\left|E\right|$$  

It is a Handshaking property.

The number of vertices and edges (V,E) in this graph is

Can there be a graph consisting of the vertices A,B,C,D with deg(A)=2, deg(B)=3, deg(C)=2, deg(D)=2 ?

Is it possible to create a graph of 12 vertices such that two of the vertices have degree 3 each and remaining 10 vertices have degree 4 each.

Your level of understanding the concept of Vertex and Handshaking property.🤝🤝