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

Cubic math, A fish tank has the base area of 45 cm3 and is filled to the de...

A fish tank has the base area of 45 cm3 and is filled to the depth of 12 cm.If the height is 25 cm then how much more will be needed to fill the rest of the tank?

Fractions, #how do I add fractions?

#how do I add fractions?

Las leyes de kepler, la expresión que permite calcular el radio medio de la...

la expresión que permite calcular el radio medio de la órbita de cada planeta es?

Retail price index, Retail price index This is weighted average of pri...

Retail price index This is weighted average of price relatives based on an average household in the base year. The items consumed are divided into groups as liker food, transp

Difererntial equation, Ask queFind the normalized differential equation whi...

Ask queFind the normalized differential equation which has {x, xex} as its fundamental setstion #Minimum 100 words accepted#

Functions of several variables - three dimensional space, Functions of Seve...

Functions of Several Variables - Three Dimensional Space In this part we want to go over a few of the basic ideas about functions of much more than one variable. Very first

Relationship between the entries of a rotation matrix, 1. A 3d rotation mat...

1. A 3d rotation matrix has 9 (3 by 3) entries, and a 2d rotation matrix has 4 (2 by 2) entries. How many actual degrees of freedom are there in a 3d or 2d rotation? In other words

Boundary value problem, solve the in-homogenous problem where A and b are c...

solve the in-homogenous problem where A and b are constants on 0 ut=uxx+A exp(-bx) u(x,0)=A/b^2(1-exp(-bx)) u(0,t)=0 u(1,t)=-A/b^2 exp(-b)

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