Discrete Mathematics
posted by Joy .
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.
Respond to this Question
Similar Questions

discrete math
Consider the graph given above. Add an edge so the resulting graph has an Euler circuit (without repeating an existing edge). Now give an Euler circuit through the graph with this new edge by listing the vertices in the order visited. … 
MATHS
A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least one of the edges vw,wx,xv is not present in G. What is the least number of vertices that G can have? 
Discrete Mathematics
Consider the complete graph with 5 vertices, denoted by K5. A. Draw the graph. B. How many edges are in K5? 
Discrete Mathematics
Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next. 
Discrete Mathematics
Let G be a graph with vertex set V = { v1, v2, v3, v4, v5}. Is it possible for the degrees of the vertices to be 3, 6, 2, 1, 5, respectively? 
Discrete Mathematics
Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}. If the degrees of the vertices are 1, 2, 3, 4, 6, respectively, how many edges are in G? 
Discrete Mathematics
Let G be a graph with vertex set V = { v1, v2, v3, v4, v5}. If the degrees of the vertices are 1, 2, 1, 3, 1, respectively, is G a tree? 
Discrete Mathematics
Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next. 
Consider the graph with V = [A, B, C, X, Y, Z] and
Consider the graph with V = [A, B, C, X, Y, Z] and E = [AX, AY, AZ, BB, CX, CY, CZ, YY]. Without drawing a picture of the graph: a. List all the vertices adjacent to Y. b. List all the edges adjacent to AY. c. Find the degree of Y. … 
Science
The type of graph used to show how a part of something relates to the whole is which of the following?