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

Work in volume problems, Work : It is the last application of integr...

Work : It is the last application of integral which we'll be looking at under this course. In this section we'll be looking at the amount of work which is done through a forc

Integration and differentiation, Integration and Differentiation Diffe...

Integration and Differentiation Differentiation deals along with the determination of the rates of change of business activities or merely the process of finding the derivativ

Dilemmas of america''s minority groups, Explain this statement " As we begi...

Explain this statement " As we begin the 21st century, the dilemmas of America's minority groups remain perhaps the primary unresolved domestic issue facing the nation." How might

Wave through the origin always has a slope of one or not, Can you explain t...

Can you explain that a wave through the origin always has a slope of one or not?

How many balls must she select of the same colour, QUESTION (a) A bowl ...

QUESTION (a) A bowl contains ten red balls and ten blue balls. A woman selects balls at random without looking at them. i) How many balls must she select to be sure of havin

Abels theorem, If y 1 (t) and y 2 (t) are two solutions to y′′ + p (t ) ...

If y 1 (t) and y 2 (t) are two solutions to y′′ + p (t ) y′ + q (t ) y = 0 So the Wronskian of the two solutions is, W(y 1 ,y 2 )(t) = =

Trigonometry, can you explain it to me please

can you explain it to me please

Speed, Town x and town y were 270km apart. a car started from town x toward...

Town x and town y were 270km apart. a car started from town x towards town y at a uniform speed of 60km/hr, while a motorcycle started from town y to town x at a uniform speed of 9

What is deductive reasoning, What is Deductive Reasoning ? Geometry is...

What is Deductive Reasoning ? Geometry is based on a deductive structure -- a system of thought in which conclusions are justified by means of previously assumed or proved sta

Mathematics Logic & Set Applications, I have a 40 question assignment for t...

I have a 40 question assignment for this topic, will you be able to complete it?

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