Recall that a subgraph H of a graph G is proper if H + G. a) Prove that if a connected graph G is a tree, then no proper spanning subgraph of G is connected. b) [NOTE: Can be solved without having done part a)!] Now prove the converse: if G is a connected graph such that no proper spanning subgraph of G is connected, then G is a tree.

Recall that a subgraph H of a graph G is proper if H + G. a) Prove that if a connected graph G is a tree, then no proper spanning subgraph of G is connected. b) [NOTE: Can be solved without having done part a)!] Now prove the converse: if G is a connected graph such that no proper spanning subgraph of G is connected, then G is a tree.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Let G be a connected graph, and let T1, T2 be two spanning trees. Prove thatT1 can be transformed to T2 by a sequence of intermediate trees, each obtainedby deleting an edge from the previous tree and adding another.
Suppose G is a connected undirected graph. An edge e whose removal disconnects the graph is called a bridge. Must every bridge e be an edge in a depth-first search tree of G? Give a proof or a counterexample.
Give an example of a connected, weighted, undirected graph such that neitherthe BFS-tree nor the DFS-tree is an MST, regardless of how the adjacency lists are orderedand at which vertex BFS or DFS are started. Argue that your graph satisfies the aboverequirements.
Given a DAG and two vertices v and w, find the lowest commonancestor (LCA) of v and w. The LCA of v and w is an ancestor of v and w that has nodescendants that are also ancestors of v and w. Computing the LCA is useful in multipleinheritance in programming languages, analysis of genealogical data (find degree ofinbreeding in a pedigree graph), and other applications. Hint : Define the height of avertex v in a DAG to be the length of the longest path from a root to v. Among verticesthat are ancestors of both v and w, the one with the greatest height is an LCA of v and w.
Give an example of each of the following or explain why no such example exists.a) A graph that is not a tree in which every edge is a bridge.b) A tree of order 4 whose complement is not a tree.
G = (V,E,W) is a weighted connected (undirected) graph where all edges have distinct weights except two edges e and e′ which have the same weight. Suppose there is a Minimum Spanning Tree of G containing both e and e′. Prove that G has a unique Minimum Spanning Tree.
Suppose we do a BFS on a connected undirected graph G and T is corresponding depth-first tree. if we remove from G all the cross edges with respecr to T the result will just be a tree. True or False?
A complete binary tree is a graph defined through the following recur- sive definition. Basis step: A single vertex is a complete binary tree.Inductive step: If T1 and T2 are disjoint complete binary trees with roots r1, r2, respectively, the graph formed by starting with a root r, and adding an edge from r to each of the vertices r1,r2 is also a complete binary tree.The set of leaves of a complete binary tree can also be defined recursively.Basis step: The root r is a leaf of the complete binary tree with exactly one vertex r.Inductive step: The set of leaves of the tree T built from trees T1, T2 is the union of the sets of leaves of T1 and the set of leaves of T2. The height h(T ) of a binary tree is defined in the class.Use structural induction to show that L(T), the number of leaves of a complete binary tree T , satisfies the following inequality L(T) ≤ 2^h(T).
Let G = (V,E) be a simple graph which is weighted, undirected, and connected. Sup- pose G contains a unique edge having the largest weight. Let emax be this edge. Suppose removing emax in G does not disconnect G. Prove that any minimum spanning tree of G must not contain the edge emax. Hint: Prove by contradiction. (Consider on the contrary that the MST contains emax. Think in this way: Can we replace this edge by some other edge to reduce the total weight?)
Prove that a minimum spanning tree of a graph component must include a shortest edge. It is possible, in Dijkstra’s algorithm, that an edge removed from the priority queue is not useful: it takes us to a previously visited node. Some of these extraneous edges can be avoided by not placing an edge in the priority queue if the destination has already been visited. Is it still possible to encounter an edge to a previously visited node?
A network is considered to be biconnected if every pair of its vertices is linked by two distinct paths. A vertex that, if it and its surrounding edges were removed, would result in the graph becoming unconnected is known as an articulation point in a linked network. show any graph without articulation points that it is biconnected. Use the fact that none of the vertices on the path is an articulation point to construct two disjoint paths connecting s and t given a set of vertices s and t and a path connecting them.
A complete binary tree is a graph defined through the following recursive definition. Basis step: A single vertex is a complete binary tree. Inductive step: If T1 and T2 are disjoint complete binary trees with roots r1, r2, respectively, the the graph formed by starting with a root r, and adding an edge from r to each of the vertices r1, r2 is also a complete binary tree. The set of leaves of a complete binary tree can also be defined recursively. Basis step: The root r is a leaf of the complete binary tree with exactly one vertex r. Inductive step: The set of leaves of the tree T built from trees T1, T2 is the union of the sets of leaves of T1 and the set of leaves of T2. The height h(T) of a binary tree is defined in the class. Use structural induction to show that `(T), the number of leaves of a complete binary tree T, satisfies the following inequality `(T) ≤ 2 h(T) .