Question

In: Math

is there a polyhedron that has 12 hexagonal faces and every vertex of degree 4?

is there a polyhedron that has 12 hexagonal faces and every vertex of degree 4?

Solutions

Expert Solution

so from Euler's formula, we can see that yes such polyhedron are possible

milcah answered 1 year ago
Next > < Previous

Related Solutions

We say a graph is k-regular if every vertex has degree exactly k. In each of...
We say a graph is k-regular if every vertex has degree exactly k. In each of the following either give a presentation of the graph or show that it does not exist. 1) 3-regular graph on 2018 vertices. 2) 3-regular graph on 2019 vertices.
Prove that any graph where every vertex has degree at most 3 can be colored with...
Prove that any graph where every vertex has degree at most 3 can be colored with 4 colors.
Use the fact that every planar graph with fewer than 12 vertices has a vertex of...
Use the fact that every planar graph with fewer than 12 vertices has a vertex of degree <= 4 to prove that every planar graph with than 12 vertices can be 4-colored.
Discrete Mathematics A tree contains 1 vertex of degree 2, 1 vertex of degree 3, 1...
Discrete Mathematics A tree contains 1 vertex of degree 2, 1 vertex of degree 3, 1 vertex of degree 4, 11 leaves and the remaining vertices have degree 3. Find the total number of vertices. Sketch two non-isomorphic trees statisfying the above mentioned conditions.
Suppose that a graph G is such that each vertex of G has degree at least...
Suppose that a graph G is such that each vertex of G has degree at least 100. Show that G contains a cycle of length at least 101, i.e., a cycle passing through at least 101 vertices.
Suppose that every driver faces a 4% probability of an automobile accident every year. An accident...
Suppose that every driver faces a 4% probability of an automobile accident every year. An accident will, on average, cost each driver $13,000. Suppose there are two types of individuals: those with $104,000.00 in the bank and those with $6,500.00 in the bank. Assume that individuals with $6,500.00 in the bank declare bankruptcy if they get in an accident. In bankruptcy, creditors receive only what individuals have in the bank. Assume that both types of individuals are only slightly risk...
Suppose that every driver faces a 4% probability of an automobile accident every year. An accident...
Suppose that every driver faces a 4% probability of an automobile accident every year. An accident will, on average, cost each driver $7,000. Suppose there are two types of individuals: those with $56,000.00 in the bank and those with $3,500.00 in the bank. Assume that individuals with $3,500.00 in the bank declare bankruptcy if they get in an accident. In bankruptcy, creditors receive only what individuals have in the bank. Assume that both types of individuals are only slightly risk...
(a) What is the maximum degree of a vertex in a simple graph with n vertices?...
(a) What is the maximum degree of a vertex in a simple graph with n vertices? (b) What is the maximum number of edges in a simple graph of n vertices? (c) Given a natural number n, does there exist a simple graph with n vertices and the maximum number of edges?
find an alternative  definition of the degree of a vertex of a graph.  please be detailed...
find an alternative  definition of the degree of a vertex of a graph.  please be detailed as possible thank you
Prove or disprove: If G = (V; E) is an undirected graph where every vertex has...
Prove or disprove: If G = (V; E) is an undirected graph where every vertex has degree at least 4 and u is in V , then there are at least 64 distinct paths in G that start at u.
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT