Discrete Mathematics
posted by Joy on .
If we consider the G as the whole of the cycle graph having 4 edges then is G a complete graph?

A cycle graph is like a polygons with vertices along the circumference.
A complete graph is one where EACH vertex is connect to EVERY OTHER vertex (except itself).
Using these definitions, are you able to answer the question? 
MathMate: No I am not able to answer this question because I am quite confused between what shapes you can use to draw them up as a cycle graph and complete graph. Also, its a little confusing to me as to how many edges each vertex should have when it comes to cycle graph or complete graph.