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

Compute simple addition, John was doing his homework on vertical addition, ...

John was doing his homework on vertical addition, and had to compute : 5 3+ 3 4  and 6 8 +45 He did the first one easily, just the way his teacher had taught him. He first ad

Domain and range of a function , Domain and range of a functio:  One of th...

Domain and range of a functio:  One of the more significant ideas regarding functions is that of the domain and range of a function. In simplest world the domain of function is th

Prove which divide these sides in the ratio 2: 1, In a right triangle ABC, ...

In a right triangle ABC, right angled at C, P and Q are points of the sides CA and CB respectively, which divide these sides in the ratio 2: 1. Prove that  9AQ 2 = 9AC 2 +4BC 2

probability , An engineer has 200 resistors that he keeps in one box. Resi...

An engineer has 200 resistors that he keeps in one box. Resistors are colored to help their identification, and in this box there are 30 white resistors, 50 black resistors, 80 red

Geometry problems, if a circles diameter is 42 mm its radius is ___________...

if a circles diameter is 42 mm its radius is _________________ because ________________________.

Integers, Whats some negative integers that equal 36

Whats some negative integers that equal 36

Pert, define algorithm of pert and pert with suitable examples

define algorithm of pert and pert with suitable examples

Example of the invisible effort, Imagine a time in history when the number ...

Imagine a time in history when the number system had not yet evolved a farmer needed to keep track of his cattle. What would he do to figure out whether his entire rattle returned

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