Prove that a simple graph is connected, Mathematics

Assignment Help:

Prove that a simple graph is connected if and only if it has a spanning tree.   

Ans: First assume that a simple graph G has a spanning  tree T.  T consists of every node of G.  By the definition of a tree, there is a path among any two nodes of T.  As T is a subgraph of G, there is a path among each pair of nodes in G. Hence G is connected.   

Here now let G is connected. If G is a tree then nothing to prove. If G is not a tree, it must consist of a simple circuit. Let G has n nodes. We can choose (n - 1) arcs from G in such type of a way that they not form a circuit. It results into a subgraph comprising all nodes and only (n - 1) arcs. So by definition this subgraph is a spanning tree.


Related Discussions:- Prove that a simple graph is connected

Find no. of diagonals, In a polygon no 3 diagnols are concurrent. If the to...

In a polygon no 3 diagnols are concurrent. If the total no of points of intersection are 70 ( interior ). find the no. of diagnols? Ans) Since no 3 diagonals are concurrent, There

Find the third vertex of a triangle, Find the third vertex of a triangle if...

Find the third vertex of a triangle if its two vertices are (-1, 4) and (5, 2) and mid point of one side is (0, 3).

Solving algebraic word problems, Solving Algebraic Word Problems: What...

Solving Algebraic Word Problems: What are the capacities of two water storage tanks in a nuclear facility if one holds 9 gallons less than three times another, and their whole

General solution to a differential equation, The general solution to a diff...

The general solution to a differential equation is the most common form which the solution can take and does not take any initial conditions in account. Illustration 5: y(t) =

Exponential smoothing, Exponential smoothing It is a weighted moving a...

Exponential smoothing It is a weighted moving average technique, this is described by: New forecast = Old forecast + a (Latest Observation - Old forecast) Whereas a = Sm

Pair of straight line, show that one of the straight lines given by ax2+2hx...

show that one of the straight lines given by ax2+2hxy+by2=o bisect an angle between the co ordinate axes, if (a+b)2=4h2

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd