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

Give the introduction to ratios and proportions, Give the introduction to R...

Give the introduction to Ratios and Proportions? A ratio represents a comparison between two values. A ratio of two numbers can be expressed in three ways: A ratio of "one t

Matrices, find inverse of [1 2 3 2 4 5 3 5 6]

find inverse of [1 2 3 2 4 5 3 5 6]

Differential equation, Question: In the interest of saving up enough mo...

Question: In the interest of saving up enough money for retirement, you have created a bank account to store a  sum of money. Compound interest on  this account is accumulated

Lesson 6 Homework Practice, For every girl taking classes at the martial ar...

For every girl taking classes at the martial arts school there are 3 boys who are taking classes at the school. If there are 236 students taking classes write and solve a proportio

Question, Hi I have a maths question related to construction as its a cons...

Hi I have a maths question related to construction as its a construction management course...i could send some example sheets too...could it be done?

Multiplication of two like terms with opposite signs, The product of -7ab a...

The product of -7ab and +3ab is (-7 x 3) a 2  b 2  = -21a 2  b 2 . In other words, a term with minus sign when multiplied with a term having a positive sign, gives a product having

Find out indegree, Question: Consider a digraph D on 5 nodes, named x0...

Question: Consider a digraph D on 5 nodes, named x0, x1,.., x4, such that its adjacency matrix contains 1's in all the elements above the diagonal A[0,0], A[1,1], A[2,2],.., e

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