0
The minimum number of edges in a connected cyclic graph on n vertices is?
Wiki User
∙ 12y ago
n-1
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
How many minimum edges in a Cyclic graph with n vertices?
The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.
What is the minimum number of vertices needed to form a polygon?
Three of them in the form of a triangle.
What do you notice about the number of sides and the number vertices apolygon has?
The number of sides and vertices are the same
What is the definition for opposite vertices?
Opposite vertices are two vertices of any polygon with an even number of sides that have the same number of sides between them.
Which figures have the same number of sides vertices and angles?
Vertices and angles are the same thing. Any polygon has an equal number of sides and vertices (and, therefore, angles).Vertices and angles are the same thing. Any polygon has an equal number of sides and vertices (and, therefore, angles).Vertices and angles are the same thing. Any polygon has an equal number of sides and vertices (and, therefore, angles).Vertices and angles are the same thing. Any polygon has an equal number of sides and vertices (and, therefore, angles).
How many minimum edges in a Cyclic graph with n vertices?
The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.
The minimum number of edges in a connected graph on n vertices is?
n-1 (o-o-o-o-o)
What prisms have vertices?
Every prism has vertices. They have an even number of vertices, with a minimum of 6 and no maximum.
What is the minimum number of vertices needed to form a polygon?
Three of them in the form of a triangle.
What is the minimum number of vertices of 3-regular graph with girth 6?
-3
What is the minimum number of triangles required to triangulate an hendecagon?
9 (two less than the number of vertices in the polygon).
If faces plus edges equals vertices plus what number follows?
There is no answer to the question as it appears. Faces + Vertices = Edges + 2 (The Euler characteristic of simply connected polyhedra).
What is the formula related vertices and edges?
There is not a specific formula fro vertices and edges. The Euler characteristic links the number of vertices, edges AND faces as follows: E + 2 = V + F for a simply connected polyhedron.
What 3D shape has 6 faces 8 vertices and 8 edges?
There can be no simply connected polyhedron with the specified number of faces, vertices and edges. The Euler characteristic requires that F + V = E + 2 where F = number of faces V = number of vertices E = number of edges This requirement is clearly not satisfied.
what solid has more vertices?
There is no limit to the number of vertices that a solid can have.There is no limit to the number of vertices that a solid can have.There is no limit to the number of vertices that a solid can have.There is no limit to the number of vertices that a solid can have.
How do you compare the number of faces to the number of vertices's in a cube?
The number of faces is 6, the number of vertices (not vertices's) is 8.
What shape has 6 faces 11 vertices and 4 edges?
No simply connected polyhedron since it does not meet the requirements of the Euler characteristic, which states that F + V = E + 2 F = number of faces V = number of vertices E = number of edges
