0
a scalene triangle a scalene triangle
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
How many faces at vertex of dodecahedron?
There are at least three faces at a vertex of a dodecahedron, and at most eleven.
How many sides does a vertex have?
A vertex is a point and so does not have any sides. In 2-dimensional space, there must be at least 2 lines meeting at a vertex and in 3-dimensional space, there must be at least 3 planes.
What can you make out of 4 trapezoids?
Eight quadrilaterals if you cut each one in two from side to side (not vertex to opposite vertex).Eight quadrilaterals if you cut each one in two from side to side (not vertex to opposite vertex).Eight quadrilaterals if you cut each one in two from side to side (not vertex to opposite vertex).Eight quadrilaterals if you cut each one in two from side to side (not vertex to opposite vertex).
Does a cone have two vertex?
No, a cone has one vertex.
What is a pendent vertex?
A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.
What is a figure with at least one vertex?
Cone
How many subgraphs with at least one vertex does w3 have?
112
How is a cone similar to a pyramid?
because they both have at least one vertex
What is the only solid with not even one vertex?
A sphere. All other solids, including cubes, rectangular prisms, and cones all have at least one vertex.
How many edges meet at a vertex?
A vertex can be the corner of a polyhedron in which case at least three edges meet at a vertex.
How many subgraphs with at least one vertex does a complete graph of 3 vertices k3 have?
one vertex: 3 two vertices: 6 three vertices: 8 total 17
How many faces at vertex of dodecahedron?
There are at least three faces at a vertex of a dodecahedron, and at most eleven.
What is the least number of points in which two triangles can intersect?
There are two ways to think of this question, if the triangles don't have to intersect then the answer is zero. If the triangles have to intersect, then the minimum number of points is one, if the triangles meat at vertex to edge or vertex to vertex.
How many sides does a vertex have?
A vertex is a point and so does not have any sides. In 2-dimensional space, there must be at least 2 lines meeting at a vertex and in 3-dimensional space, there must be at least 3 planes.
What kind of polygon has at least one dent that is a vertex pointing toward the interior of the polygon?
A concave polygon.
Why one a cone have one vertex?
a vertex is a line to a point
What is vertex cover problem?
A vertex cover of a graph is a set of vertecies where every edge connects to at least one vertex in the set.As a concrete example, a student club where if any two students are friends, then at least one is in the club.Suppose the school has three students, A, B, and C. A and B are friends and A and C are friends, but B and C are not friends. One obvious vertex cover would be to have all the students in the club, {A.B.C}. Another would be just {B,C}. Another would be just {A}.{B} would not be a vertex cover, since A and C are friends, but neither is in the club.The optimal vertex cover is the smallest possible vertex cover. In the school friends example, {A} is the optimal vertex cover. In general, the opitmal vertex cover problem is NP-complete, which makes it a very difficult problem for large groups, and interesting problem in computer science.
