answersLogoWhite

0


Best Answer

A tetrahedron (a triangular pyramid) has these properties. But I'm not sure what you mean by show the net.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What 3D shape has 6 edges 4 faces 4 vertices and show the net?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

What 3 expessions show a pyramids number of faces and vertices and edges?

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges.


How can you show that every Hamiltonian cubic graph is 3-edge-colorable?

A cubic graph must have an even number of vertices. Then, a Hamilton cycle (visiting all vertices) must have an even number of vertices and also an even number of edges. Alternatively color this edges red and blue, and the remaining edges green.


How many edges must a simple graph with n vertices have in order to guarantee that it is connected?

The non-connected graph on n vertices with the most edges is a complete graph on n-1 vertices and one isolated vertex. So you must have one more than (n-1)n/2 edges to guarantee connectedness. It is easy to see that the extremal graph must be the union of two disjoint cliques (complete graphs). (Proof:In a non-connected graph with parts that are not cliques, add edges to each part until all are cliques. You will not have changed the number of parts. If there are more than two disjoint cliques, you can join cliques [add all edges between them] until there are only two.) It is straightforward to create a quadratic expression for the number of edges in two disjoint cliques (say k vertices in one clique, n-k in the other). Basic algebra will show that the maximum occurs when k=1 or n-1. (We're not allowing values outside that range.)


Show you what the math shape pentagon looks like?

show me what a pentagon shape looks like


What is the relationship between 3-d shapes and their 2-d faces?

1

Related questions

What 3 expessions show a pyramids number of faces and vertices and edges?

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges.


Can you show me what a rectangular prism is?

A rectangular prism is a cuboid that has 6 faces, 12 edges and 8 vertices


What 3d shape has 16 edges 10 vertices 7 faces?

None.The closest would be a pentagonal prism which has 15edges, 10 vertices and 7 faces.Euler's characteristics for prisms show that V - E + F must equal 2.


. Trevor said a cube has 3 faces 7 vertices and 9 edges. He drew a picture to show he was correct. How would you respond?

Trevor is wrong because a cube has 6 faces, 8 vertices and 12 edges and the picture drawn was probably a 2 dimensional image of a cube.


How can you show that every Hamiltonian cubic graph is 3-edge-colorable?

A cubic graph must have an even number of vertices. Then, a Hamilton cycle (visiting all vertices) must have an even number of vertices and also an even number of edges. Alternatively color this edges red and blue, and the remaining edges green.


Show shape that has more than 4 vertices?

A cube has 8, a pentagon has 5...


Show that the star graph is the only bipartiate graph which is a tree?

A star graph, call it S_k is a complete bipartite graph with one vertex in the center and k vertices around the leaves. To be a tree a graph on n vertices must be connected and have n-1 edges. We could also say it is connected and has no cycles. Now a star graph, say S_4 has 3 edges and 4 vertices and is clearly connected. It is a tree. This would be true for any S_k since they all have k vertices and k-1 edges. And Now think of K_1,k as a complete bipartite graph. We have one internal vertex and k vertices around the leaves. This gives us k+1 vertices and k edges total so it is a tree. So one way is clear. Now we would need to show that any bipartite graph other than S_1,k cannot be a tree. If we look at K_2,k which is a bipartite graph with 2 vertices on one side and k on the other,can this be a tree?


What type of map doesn't show distortion?

shape and size are disterted with the greatest distortions on the outer edges of the map


Show that atree has at least tow vertices of degree 1?

Show that a tree has at least 2 vertices of degree 1


What does vertical means?

I want you to show me on the shape what a vertices mean


How many edges must a simple graph with n vertices have in order to guarantee that it is connected?

The non-connected graph on n vertices with the most edges is a complete graph on n-1 vertices and one isolated vertex. So you must have one more than (n-1)n/2 edges to guarantee connectedness. It is easy to see that the extremal graph must be the union of two disjoint cliques (complete graphs). (Proof:In a non-connected graph with parts that are not cliques, add edges to each part until all are cliques. You will not have changed the number of parts. If there are more than two disjoint cliques, you can join cliques [add all edges between them] until there are only two.) It is straightforward to create a quadratic expression for the number of edges in two disjoint cliques (say k vertices in one clique, n-k in the other). Basic algebra will show that the maximum occurs when k=1 or n-1. (We're not allowing values outside that range.)


Why do criminals steal money if they can't show their faces in public?

Criminals are not instantly recognisable by the entire population. Of course they can show their faces in public