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.

Expert Solution

Colby Messinger answered 1 year 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...

Let G be connected, and let e be an edge of G. Prove that e is...

Let G be connected, and let e be an edge of G. Prove that e is a bridge if and only if it is in every spanning tree of G.

Given a connected graph G with n vertices. We say an edge of G is a...

Given a connected graph G with n vertices. We say an edge of G is a bridge if the graph becomes a disconnected graph after removing the edge. Give an O(m + n) time algorithm that finds all the bridges. (Partial credits will be given for a polynomial time algorithm.) (Hint: Use DFS)

You are given an undirected graph G = ( V, E ) in which the edge...

You are given an undirected graph G = ( V, E ) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight from 1 to W, where W is a constant (independent of the number of edges or vertices). Show that it is possible to compute the single-source shortest paths in such a graph in O(E+V) time.

A graph G = (V, E) is a near-tree if it is connected and has at...

A graph G = (V, E) is a near-tree if it is connected and has at most n+ 8 edges, where n = |V |. Give an algorithm with running time O(n) that takes a near-tree G with costs on its edges, and returns a minimum spanning tree of G. Assume all the edge costs are distinct.

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.

Given a connected graph G where edge costs are pair-wise distinct, prove or disprove that the...

Given a connected graph G where edge costs are pair-wise distinct, prove or disprove that the G has a unique MST. Please write Pseudo-code for the algorithms.

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.

# Problem Description Given a directed graph G = (V,E) with edge length l(e) > 0...

# Problem Description Given a directed graph G = (V,E) with edge length l(e) > 0 for any e in E, and a source vertex s. Use Dijkstra’s algorithm to calculate distance(s,v) for all of the vertices v in V. (You can implement your own priority queue or use the build-in function for C++/Python) # Input The graph has `n` vertices and `m` edges. There are m + 1 lines, the first line gives three numbers `n`,`m` and `s`(1 <=...

Design a linear-time algorithm which, given an undirected graph G and a particular edge e in...

Design a linear-time algorithm which, given an undirected graph G and a particular edge e in it, determines whether G has a cycle containing e. Your algorithm should also return the length (number of edges) of the shortest cycle containing e, if one exists. Just give the algorithm, no proofs are necessary. Hint: you can use BFS to solve this.

Question