You are told that a fully connected graph has 281 vertices. You
are also told that the same connected graph has a
minimum spanning tree with x edges, where x i s not known. Knowing
this i nformation, which of the following i s/are
possible values of x ? Select all that apply.
A. 278
B. 279
C. 280
D. 281
E. 282
Solution
one possible solution is
Explanation
A minimum spanning tree has (V(Vertices) – 1) edges where V is the number of vertices in the given graph
in the question given is
fully connected graph has 281 vertices
so v is 281
apply that formula
281-1
=280 edges
---
i tried one solution
really sorry if i miss anything
all the best
You are told that a fully connected graph has 281 vertices. You are also told that...
Suppose you are given a connected graph G, with edge costs that you may assume are all distinct. G has n vertices and m edges. A particular edge e of G is specified. Give an algorithm with running time O(m + n) to decide whether e is contained in a minimum spanning tree of G.
Recall the definition of the degree of a vertex in a graph. a) Suppose a graph has 7 vertices, each of degree 2 or 3. Is the graph necessarily connected ? b) Now the graph has 7 vertices, each degree 3 or 4. Is it necessarily connected? My professor gave an example in class. He said triangle and a square are graph which are not connected yet each vertex has degree 2. (Paul Zeitz, The Art and Craft of Problem...
Let G=(V, E) be a connected graph with a weight w(e) associated with each edge e. Suppose G has n vertices and m edges. Let E’ be a given subset of the edges of E such that the edges of E’ do not form a cycle. (E’ is given as part of input.) Design an O(mlogn) time algorithm for finding a minimum spanning tree of G induced by E’. Prove that your algorithm indeed runs in O(mlogn) time. A minimum...
2. Let G = (V, E) be an undirected connected graph with n vertices and with an edge-weight function w : E → Z. An edge (u, v) ∈ E is sparkling if it is contained in some minimum spanning tree (MST) of G. The computational problem is to return the set of all sparkling edges in E. Describe an efficient algorithm for this computational problem. You do not need to use pseudocode. What is the asymptotic time complexity of...
er (a) Let G be a connected graph and C a non-trivial circuit in G. Prove directly that if an edge ={a, b} is removed from then the subgraph S CG that remains is still connected. Directly' means using only the definitions of the concepts involved, in this case 'connected' and 'circuit'. Hint: If r and y are vertices of G connected by path that includes e, is there an alternative path connecting x to y that avoids e? (b)...
Consider the graph at right. 17 15 [a] In what order are the vertices visited using DFS 319 1 starting from vertex a? Where a choice exists, use alphabetical order. What if you use BFS? [b A vertex x is "finished" when the recursive call DFS (x) terminates. In what order are the vertices finished? (This is different from the order in which they are visited, when DFS (x) is called.) [c] In what order are edges added to the...
Question 1# (a) Let G be a connected graph and C a non-trivial circuit in G. Prove directly that if an edge e fa, b is removed from C then the subgraph S C G that remains is still connected. "Directly' means using only the definitions of the concepts involved, in this case connected' and 'circuit'. Hint: If z and y are vertices of G connected by path that includes e, is there an alternative path connecting x to y...
1. [10 marks) Suppose a connected graph G has 10 vertices and 11 edges such that A(G) = 4 and 8(G) = 2. Let nd denote the number of vertices of degree d in G. (i) List all the possible triples (n2, N3, n4). (ii) For each triple (n2, n3, nd) in part (i), draw two non-isomorphic graphs G with n2 vertices of degree 2, në vertices of degree 3 and n4 vertices of degree 4. You need to explain...
4. (10 points) (a) An undirected graph has 6 vertices and 13 edges. It is known three vertices have degree 3, one has degree 4, and another one has degree 7. Find the degree of the remaining vertex. (b) For each of the following graphs, determine if it is bipartite, complete, and/or a tree. Give a brief written or graphical justification for your answers (you may address multiple graphs at the same time). iii.
File Edit Format View Help Graphs and trees 4. [6 marks] Using the following graph representation (G(V,E,w)): v a,b,c,d,e,f E fa,b), (a,f),fa,d), (b,e), (b,d), (c,f),(c,d),(d,e),d,f)) W(a,b) 4,W(a,f) 9,W(a,d) 10 W(b,e) 12,W(b,d) 7,W(c,d) 3 a) Draw the graph including weights. b) Given the following algorithm for Inding a minimum spanning tree for a graph: Given a graph (G(V,E)) create a new graph (F) with nodes (V) and no edges Add all the edges (E) to a set S and order them...