13.6 Let G be a simple connected cubic plane graph, and let pk be the number...

13.6 Let G be a simple connected cubic plane graph, and let pk be the number of k-sided faces. By counting the number of vertices and edges of G, prove that

3p3 + 2p4 + p5 - c7 - 2p8 - • • • = 12.

Deduce that G has at least one face bounded by at most five edges.

Expert Solution

Colby Messinger answered 3 hours ago

Let G be a connected graph and let e be a cut edge in G. Let...

Let G be a connected graph and let e be a cut edge in G. Let K be the subgraph of G defined by: V(K) = V(G) and E(K) = E(G) - {e} Prove that K has exactly two connected components. First prove that e cannot be a loop. Thus the endpoint set of e is of the form {v,w}, where v ≠ w. If ṽ∈V(K), prove that either there is a path in K from v to ṽ, or...

Suppose G is a connected cubic graph (regular of degree 3) and e is an edge...

Suppose G is a connected cubic graph (regular of degree 3) and e is an edge such that G − e has two connected components G1 and G2 (a) Explain what connected means. (b) We say that e is a____________ of G (c) show that G1 has an odd number of vertices. (d) draw a connected cubic graph G with an edge e as above.

Let G be a simple graph. G is said to be maximal planar if it is...

Let G be a simple graph. G is said to be maximal planar if it is planar and the addition of any new edge to G results in a (simple) non-planar graph. Examples of maximal non-planar graphs are K4 , K5 minus an edge, and K3,3 minus an edge. (a) Show that a maximal planar graph is connected. (b) Show that a maximal planar graph of order ≥3 has no bridges. (c) Show that every face of a maximal planar...

Let G be a simple undirected graph with n vertices where n is an even number....

Let G be a simple undirected graph with n vertices where n is an even number. Prove that G contains a triangle if it has at least (n^2 / 4) + 1 edges using mathematical induction.

Let k be an integer satisfying k ≥ 2. Let G be a connected graph with...

Let k be an integer satisfying k ≥ 2. Let G be a connected graph with no cycles and k vertices. Prove that G has at least 2 vertices of degree equal to 1.

Let G be a simple graph. Prove that the connection relation in G is an equivalence...

Let G be a simple graph. Prove that the connection relation in G is an equivalence relation on V (G)

Let G be a simple planar graph with no triangles. (a) Show that G has a...

Let G be a simple planar graph with no triangles. (a) Show that G has a vertex of degree at most 3. (The proof was sketched in the lectures, but you must write all the details, and you may not just quote the result.) (b) Use this to prove, by induction on the number of vertices, that G is 4-colourable.

Question

13.6 Let G be a simple connected cubic plane graph, and let pk be the number...

Solutions

Expert Solution

Related Solutions