Posted by Joy on Thursday, August 8, 2013 at 3:35pm.
If we consider the G as the whole of the cycle graph having 4 edges then is G a complete graph?

Discrete MathematicsElementary graph theory  MathMate, Thursday, August 8, 2013 at 9:44pm
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?

Discrete Mathematics  Joy, Friday, August 9, 2013 at 1:19pm
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.
Answer This Question
Related Questions
 Discrete Mathematics  Consider the complete graph with 5 vertices, denoted by ...
 Discrete Mathematics  Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
 Discrete Mathematics  Using Fleury's Algorithm in the graph to the bottom left...
 Discrete Mathematics  Using Fleury's Algorithm in the graph to the bottom left...
 Consider the graph with V = [A, B, C, X, Y, Z] and  Consider the graph with V...
 Science  The type of graph used to show how a part of something relates to the...
 discrete math  Consider the graph given above. Add an edge so the resulting ...
 Discrete Mathematics  Let G be a graph with vertex set V = { v1, v2, v3, v4, v5...
 Discrete Mathematics  Let G be a graph with vertex set V = { v1, v2, v3, v4, v5...
 MATHS  A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least...
More Related Questions