SOLUTION: Draw the graph described or else explain why there is no such graph. a) a graph with five vertices each with a degree of 3 b) a graph with four vertices having degrees 1,2,2,3

Algebra.Com
Question 96490: Draw the graph described or else explain why there is no such graph.
a) a graph with five vertices each with a degree of 3
b) a graph with four vertices having degrees 1,2,2,3
c) a graph with a three vertices having degrees 2,5,5
d) a SIMPLE graph with five vertices having degrees 1,2,3,3,5
e. A 4-regualr graph with four vertices

Thanks for the help in advance.

Answer by stanbon(75887)   (Show Source): You can put this solution on YOUR website!
Draw the graph described or else explain why there is no such graph.
a) a graph with five vertices each with a degree of 3
You could draw a 5-pointed star with an angle of 3 degrees at each point.
----------------------
b) a graph with four vertices having degrees 1,2,2,3
You could draw a 4-pointed star with angles of the specified degree.
-----------------------
c) a graph with a three vertices having degrees 2,5,5
You could draw a 3-pointed figure with angles of the specified degree.
-----------------------
d) a SIMPLE graph with five vertices having degrees 1,2,3,3,5
Same as above depending on what you mean by SIMPLE.
-------------------------
e. A 4-regular graph with four vertices
Depends on what you mean by "4-regular".
-----------------------
Cheers,
Stan H.

RELATED QUESTIONS

An Eulerian Path is a graph traversal that starts at some vertex and traverses every edge (answered by CPhill)
A binary tree is a connected graph with no cycles, where each vertex has a degree less... (answered by greenestamps)
A binary tree is a connected graph with no cycles, where each vertex has a degree less... (answered by CPhill)
draw a graph with 7 vertices and two... (answered by richard1234)
Create a graph with five vertices, no bridge, and a loop. Please help.... (answered by jim_thompson5910)
Create a graph with five vertices, no bridge, and a loop. (answered by rfer,jim_thompson5910)
I'm totally lost on this and would like someone to please explain it to me in simple... (answered by John10)
i need help with polynomials it says to state the degree and leading coefficient of each (answered by stanbon)
Connet all the vertices with 2 colours, such that there exists no triangle with all 3... (answered by richard1234)