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

How do you traverse a binary tree, How do you traverse a Binary Tree?  Desc...

How do you traverse a Binary Tree?  Describe Preorder, Inorder and Postorder traversals with example.     Ans: Traversal of tree means tree searching for a aim. The aim may be

Order to solve mathematical operations, Order to solve Mathematical Operati...

Order to solve Mathematical Operations: Example: Solve the following equation: (4 - 2) + (3 x 4) - (10 ÷ 5) - 6 =  ____________ Solution: a.         Perform ma

Finding the inverse of a function , Finding the Inverse of a Function : Th...

Finding the Inverse of a Function : The procedure for finding the inverse of a function is a rather simple one although there are a couple of steps which can on occasion be somewh

Rectilinear figure, In a parallelogram ABCD AB=20cm and AD=12cm.The bisecto...

In a parallelogram ABCD AB=20cm and AD=12cm.The bisector of angle A meets DC at E and BC produced at F.Find the length of CF.

Prove - digraph of a partial order has no cycle more than 1, Prove that the...

Prove that the Digraph of a partial order has no cycle of length greater than 1. Assume that there exists a cycle of length n ≥ 2 in the digraph of a partial order ≤ on a set A

How many different words can be formed out from varanasi, Determine how man...

Determine how many different words can be formed out of the letters of the word VARANASI? Ans: 720 different words can be formed out of the letters of the word VARANASI.

Estimate the probability, The following (artificial) data record the length...

The following (artificial) data record the length of stay (in days) spent on a psychiatric ward for 28 consecutive patients who have been sectioned under the mental health act, cla

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