Question

Suppose that a connected planar graph has eight vertices each of degree 3 then how many...

  1. Suppose that a connected planar graph has eight vertices each of degree 3 then how many regions does it have?And suppose that a polyhedron has 12 triangular faces then determine the number of edges and vertices.

Homework Answers

Answer #1

We have solved both the problems using Euler's formula.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Suppose that a connected graph without loops or parallel edges has 11 vertices, each of degree...
Suppose that a connected graph without loops or parallel edges has 11 vertices, each of degree 6. a. Must the graph have an Euler Circuit? Explain b. Must the graph have a Hamilton Circuit? Explain c. If the graph does have an Euler Circuit, how many edges does the circuit contain? d. If the graph does have a Hamilton Circuit, what is its length?
If a connected 3-regular planar graph G has 18 vertices, then the number of faces of...
If a connected 3-regular planar graph G has 18 vertices, then the number of faces of a planar representation of G is..........
G is a complete bipartite graph on 7 vertices. G is planar, and it has an...
G is a complete bipartite graph on 7 vertices. G is planar, and it has an Eulerian path. Answer the questions, and explain your answers. 1. How many edges does G have? 2. How many faces does G have? 3. What is the chromatic number of G?
Suppose we are going to color the vertices of a connected planar simple graph such that...
Suppose we are going to color the vertices of a connected planar simple graph such that no two adjacent vertices are with the same color. (a) Prove that if G is a connected planar simple graph, then G has a vertex of degree at most five. (b) Prove that every connected planar simple graph can be colored using six or fewer colors.
Let there be planar graph G with 12 vertices where every vertices may or may not...
Let there be planar graph G with 12 vertices where every vertices may or may not be connected by an edge. The edges in G cannot intersect. What is the maximum number of edges in G. Draw an example of G. What do you notice about the faces and the maximum number of edges?
show that any simple, connected graph with 31 edges and 12 vertices is not planar.
show that any simple, connected graph with 31 edges and 12 vertices is not planar.
Question 38 A simple connected graph with 7 vertices has 3 vertices of degree 1, 3...
Question 38 A simple connected graph with 7 vertices has 3 vertices of degree 1, 3 vertices of degree 2 and 1 vertex of degree 3. How many edges does the graph have? Question 29 Use two of the following sets for each part below. Let X = {a, b, c}, Y = {1, 2, 3, 4} and Z = {s, t}. a) Using ordered pairs define a function that is one-to-one but not onto. b) Using ordered pairs define...
30. a) Show if G is a connected planar simple graph with v vertices and e...
30. a) Show if G is a connected planar simple graph with v vertices and e edges with v ≥ 3 then e ≤ 3v−6. b) Further show if G has no circuits of length 3 then e ≤ 2v−4.
Use proof by induction to prove that every connected planar graph with less than 12 vertices...
Use proof by induction to prove that every connected planar graph with less than 12 vertices has a vertex of degree at most 4.
A graph is called planar if it can be drawn in the plane without any edges...
A graph is called planar if it can be drawn in the plane without any edges crossing. The Euler’s formula states that v − e + r = 2, where v,e, and r are the numbers of vertices, edges, and regions in a planar graph, respectively. For the following problems, let G be a planar simple graph with 8 vertices. Find the maximum number of edges in G. Find the maximum number of edges in G, if G has no...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT