n-1 (o-o-o-o-o)
Chat with our AI personalities
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.
There is no limit to the number of vertices nor edges.
Sphere ( 0 faces , 0 edges , 0 vertices )
Faces + Vertices = Edges + 2
the formula is (vertices+faces)- 2= edges
n-1
A Connected Pyramids have 10 Faces, 12 Vertices, 20 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.
There is no answer to the question as it appears. Faces + Vertices = Edges + 2 (The Euler characteristic of simply connected polyhedra).
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.
no numbers have the same number of edges and vertices
If you add the vertices and Faces and subtract 2 from that number you get the number of edges. Vertices+Faces=Edges+2
In a prism, the number of faces, vertices, and edges are related by the formula F + V - E = 2, known as Euler's formula. For a prism, which has two parallel and congruent faces connected by rectangular faces, the number of faces (F) is equal to the sum of the number of rectangular faces and the two congruent bases. The number of vertices (V) is equal to the number of corners where edges meet, and the number of edges (E) is equal to the sum of the edges around the bases and the edges connecting the corresponding vertices of the bases.
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
A sphere- there are no faces, edges or vertices
for any prism , number of ___ + number of vertices = number of edges + ___
There is no limit to the number of vertices nor edges.