0
No, the complete graph of 5 vertices is non planar. because we cant make any such complete graph which draw without cross over the edges . if there exist any crossing with respect to edges then the graph is non planar.
Note:- a graph which contain minimum one edge from one vertex to another is called as complete graph...
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
How many faces' edges and vertices's do a pentagon have?
A pentagon has 5 edges and 5 vertices
What solid has 5 faces and 5 vertices?
A rectangular pyramid (four-sided base) has 5 faces and 5 vertices.
How many faces edges vertices's does rectangular pyramid have?
A rectangular pyramid has 5 faces, 8 edges and 5 vertices. And it is not vertices's or vertices's's.
What shape or figure has 5 sides and 5 vertices?
A pentagon has five sides and five vertices
How many faces edges and vertices on a rectangular pyramid?
5 faces, 8 edges and 5 vertices.
Can a connected planar graph be drawn so that it has 5 vertices 7 regions and 10 edges?
No.No.No.No.
How many spanning trees can be drawn with 5 labeled vertices?
No of spanning trees in a complete graph Kn is given by n^(n-2) so for 5 labelled vertices no of spanning trees 125
What is the maximum number of distinct edges in an undirected graph with N vertices?
Let G be a complete graph with n vertices. Consider the case where n=2. With only 2 vertices it is clear that there will only be one edge. Now add one more vertex to get n = 3. We must now add edges between the two old vertices and the new one for a total of 3 vertices. We see that adding a vertex to a graph with n vertices gives us n more edges. We get the following sequence Edges on a graph with n vertices: 0+1+2+3+4+5+...+n-1. Adding this to itself and dividing by two yields the following formula for the number of edges on a complete graph with n vertices: n(n-1)/2.
Does there exist a simple graph with 7 vertices having degrees 1 3 3 4 5 6 6?
No. Since the graph is simple, none of the vertices connect to themselves - that is, there are no arcs that loop back on themselves. Then the two vertices with degree 6 must connect to all the other vertices. Therefore there can be no vertex with less than two arcs [ to these two vertices]. So a vertex with degree 1 cannot be part of the graph.
How many vertices does a rectangular pyramid have have?
A rectangular pyramid has 5 vertices.5 faces8 edges5 vertices
How many vertices and edges does a quadrilateral pyramid have?
5 vertices and 8 edges.5 vertices and 8 edges.5 vertices and 8 edges.5 vertices and 8 edges.
Which polygon has more than 5 vertices?
Every polygon that is not a triabgle (3 vertices), quadrilateral (4 vertices) or pentagon (5 vertices) has more than 5 vertices.
What is the number of vertices for a pentagon?
It has 5 vertices and 5 sides
What is a pollygon with 5 sides and 5 vertices?
A polygon with 5 sides/vertices is called a pentagon.
How many vertices does 5 cuboids have?
A cuboid has 8 vertices so 5 cuboids have 5*8 = 40 vertices.
How many vertices does a squared based pyramid have?
According to Euler's theorem= Edges+2=Vertices+Faces No of faces= 5 No of vertices= ? No of edges=8 8+2=5+vertices 10= 5+vertices 10-5 = vertices 5 vertices Hence 5 vertices are present in square based pyramid. This theorem works everywhere
How many vertices does a pentagon have?
A 5 sided pentagon has 5 vertices
